Sciweavers

798 search results - page 93 / 160
» Proving More Properties with Bounded Model Checking
Sort
View
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 6 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise
FM
2008
Springer
152views Formal Methods» more  FM 2008»
13 years 9 months ago
Constraint Prioritization for Efficient Analysis of Declarative Models
The declarative modeling language Alloy and its automatic analyzer provide an effective tool-set for building designs of systems and checking their properties. The Alloy Analyzer p...
Engin Uzuncaova, Sarfraz Khurshid
SIAMCOMP
2002
113views more  SIAMCOMP 2002»
13 years 7 months ago
A Layered Analysis of Consensus
This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysi...
Yoram Moses, Sergio Rajsbaum
FTRTFT
1998
Springer
13 years 12 months ago
On the Need for Practical Formal Methods
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
Constance L. Heitmeyer
SIGSOFT
2009
ACM
14 years 8 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang