1116 search results - page 23 / 224 » Applying Predicate Abstraction to Abstract State Machines |
88
Voted
CORR
2000
Springer
14 years 11 months ago
2000
Springer
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in th...
LOPSTR
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
GECCO
2010
Springer
14 years 11 months ago
2010
Springer
State machines are a popular method of representing a syshigh level of abstraction that enables developers to gain an overview of the system they represent and quickly understand ...
RULEML
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. When developing situation awareness applications we begin by constructing an OWL ontology to capture a language of discourse for the domain of interest. Such an ontology,...
MEMOCODE
2005
IEEE
15 years 4 months ago
2005
IEEE
We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We de...