Sciweavers

788 search results - page 143 / 158
» Symbolic Equivalence Checking
Sort
View
FORTE
2008
13 years 9 months ago
Program Repair Suggestions from Graphical State-Transition Specifications
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...
Farn Wang, Chih-Hong Cheng
CDC
2009
IEEE
126views Control Systems» more  CDC 2009»
13 years 8 months ago
Reachability analysis for a class of Petri nets
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
Yu Ru, Christoforos N. Hadjicostis
EJC
2008
13 years 7 months ago
Locally constrained graph homomorphisms and equitable partitions
We explore the connection between locally constrained graph homomorphisms and degree matrices arising from an equitable partition of a graph. We provide several equivalent charact...
Jirí Fiala, Daniël Paulusma, Jan Arne ...
ENTCS
2007
98views more  ENTCS 2007»
13 years 7 months ago
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...
Jesper Bengtson, Joachim Parrow
SPE
2008
89views more  SPE 2008»
13 years 7 months ago
The Runabout
This paper presents a variation of the visitor pattern which allows programmers to write visitor-like code in a concise way. The Runabout is a library extension that adds a limited...
Christian Grothoff