Sciweavers

1894 search results - page 379 / 379
» A TLA Proof System
Sort
View
SAS
2010
Springer
121views Formal Methods» more  SAS 2010»
13 years 3 months ago
Alternation for Termination
Proving termination of sequential programs is an important problem, both for establishing the total correctness of systems and as a component of proving more general termination an...
William R. Harris, Akash Lal, Aditya V. Nori, Srir...
TCS
2011
13 years 9 days ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
JACM
2010
120views more  JACM 2010»
13 years 5 days ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
IFM
2007
Springer
129views Formal Methods» more  IFM 2007»
13 years 11 months ago
Slotted-Circus
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
Andrew Butterfield, Adnan Sherif, Jim Woodcock