Partition refinement

In the design of algorithms, partition refinement is a technique for representing a partition of a set as a data structure that allows the partition…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational…

2016

2012

We present and evaluate a straightforward method of representing finite runs of a parametric timed automaton (PTA) by means of…

2010

Predicate abstraction is a major abstraction technique for the verification of software. Data is abstracted by means of Boolean…

2009

We describe a dynamic partitioning scheme usable by model checking techniques that divide the state space into partitions, such…

2006

This paper covers a description of the algorithms and data-structures used in the parallel DLR TAU-code Adaptation tool…

1999

This thesis is about natural language parsing with corpus-based grammars that are enriched with statistics. Parsing is the…

1999

Software development raises the need for traceability, i.e., the ability to control the consistency among software artifacts pr…

1995

The decrease of nondeterminism development paradigm that underlies most refinement approaches for concurrent systems is…

1994

Interpretation of Reactive Systems: Preservation of CTL Dennis Dams Orna Grumberg Rob Gerth