2514 search results - page 219 / 503 » The use of industrial-strength formal methods |
195
click to vote
FMCAD
2004
Springer
15 years 12 months ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
198
click to vote
AGP
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper, we describe a Prolog implementation of a new theorem prover for (normal propositional) modal and multi–modal logics. The theorem prover, which is called KEM, arise...
149
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Verification methods for memory-manipulating C programs need to address not only well-typed programs that respect invariants such as the split heap memory model, but also programs...
180
click to vote
SCCC
2008
IEEE
16 years 27 days ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In this work an automatic meth...
197
click to vote
MEMOCODE
2005
IEEE
16 years 3 days ago
2005
IEEE
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...