Sciweavers

799 search results - page 29 / 160
» A Logic for Abstract State Machines
Sort
View
RULEML
2010
Springer
14 years 8 months ago
On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...
Ho-Pun Lam, Guido Governatori
ICCAD
2002
IEEE
110views Hardware» more  ICCAD 2002»
15 years 6 months ago
Whirlpool PLAs: a regular logic structure and their synthesis
 A regular circuit structure called a Whirlpool PLA (WPLA) is proposed. It is suitable for the implementation of finite state machines as well as combinational logic. A WPLA is ...
Fan Mo, Robert K. Brayton
ASM
2005
ASM
15 years 3 months ago
Applying Formal Semantics of an Object-oriented Language to Program Invariant Checking
We consider a specific kind of Abstract State Machines. It is shown how the machines can be used to provide a low-level formal semantics for a tiny object-oriented language, inclu...
Andrey Novikov, Rostislav Yavorskiy
IANDC
2008
114views more  IANDC 2008»
14 years 9 months ago
Generalizing the Paige-Tarjan algorithm by abstract interpretation
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
Francesco Ranzato, Francesco Tapparo
ICFP
2010
ACM
14 years 10 months ago
The impact of higher-order state and control effects on local relational reasoning
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
Derek Dreyer, Georg Neis, Lars Birkedal