788 search results - page 68 / 158 » Symbolic Equivalence Checking |
TABLEAUX
2009
Springer
14 years 2 months ago
2009
Springer
Memory logics are modal logics whose semantics is specified in terms of relational models enriched with additional data structure to represent memory. The logical language is then...
TOPNOC
2008
13 years 7 months ago
2008
Process Algebras are formalisms for modelling concurrent systems that permit mathematical reasoning with respect to a set of desired properties. TAPAs is a tool that can be used to...
FASE
2006
Springer
13 years 11 months ago
2006
Springer
Techniques for inferring a regular language, in the form of a finite automaton, from a sufficiently large sample of accepted and nonaccepted input words, have been employed to cons...
GLVLSI
2005
IEEE
14 years 1 months ago
2005
IEEE
Boolean Satisfiability (SAT) solvers are popular engines used throughout the verification world. Bounded sequential problems such as bounded model checking and bounded sequentia...
FM
2003
Springer
14 years 1 months ago
2003
Springer
Software systems are often model checked by translating them into a directly model-checkable formalism. Any serious software system requires application of compositional reasoning ...