Sciweavers

799 search results - page 16 / 160
» A Logic for Abstract State Machines
Sort
View
POPL
2010
ACM
15 years 7 months ago
A Relational Modal Logic for Higher-Order Stateful ADTs
The method of logical relations is a classic technique for proving the equivalence of higher-order programs that implement the same observable behavior but employ different intern...
Derek Dreyer, Georg Neis, Andreas Rossberg, Lars B...
IWFM
1998
136views Formal Methods» more  IWFM 1998»
14 years 11 months ago
Translating Structured Database Schemas into Abstract Machines
ing Structured Database Schemas into Abstract Machines Brian Matthews Rutherford Appleton Laboratory, Didcot, OXON, OX11 OQX, U.K. Elvira Locuratolo Istituto di Elaborazione dell&#...
Brian Matthews, Elvira Locuratolo
LFCS
2007
Springer
15 years 3 months ago
Reasoning About Sequences of Memory States
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...
Rémi Brochenin, Stéphane Demri, &Eac...
DAC
1994
ACM
15 years 1 months ago
Probabilistic Analysis of Large Finite State Machines
Regarding nite state machines as Markov chains facilitates the application of probabilistic methods to very large logic synthesis and formal veri cation problems. Recently, we ha...
Gary D. Hachtel, Enrico Macii, Abelardo Pardo, Fab...
CORR
2010
Springer
120views Education» more  CORR 2010»
14 years 9 months ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken