Sciweavers

76 search results - page 13 / 16
» Cartesian Partial-Order Reduction
Sort
View
POPL
1997
ACM
13 years 11 months ago
Type-Checking Higher-Order Polymorphic Multi-Methods
We present a new predicative and decidable type system, called ML , suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML...
François Bourdoncle, Stephan Merz
FM
2009
Springer
169views Formal Methods» more  FM 2009»
13 years 11 months ago
Model Checking Linearizability via Refinement
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
Yang Liu 0003, Wei Chen, Yanhong A. Liu, Jun Sun 0...
FMICS
2006
Springer
13 years 11 months ago
Test Coverage for Loose Timing Annotations
Abstract. The design flow of systems-on-a-chip (SoCs) identifies several abstraction levels higher than the Register-Transfer-Level that constitutes the input of the synthesis tool...
Claude Helmstetter, Florence Maraninchi, Laurent M...
FORMATS
2006
Springer
13 years 11 months ago
Adding Invariants to Event Zone Automata
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
Peter Niebert, Hongyang Qu
FMICS
2008
Springer
13 years 9 months ago
Efficient Symbolic Model Checking for Process Algebras
Different approaches have been developed to mitigate the state space explosion of model checking techniques. Among them, symbolic verification techniques use efficient representati...
José Vander Meulen, Charles Pecheur