Sciweavers

767 search results - page 79 / 154
» Logic for Mathematical Writing
Sort
View
AMAST
2006
Springer
13 years 9 months ago
DO-Casl: An Observer-Based Casl Extension for Dynamic Specifications
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...
Matteo Dell'Amico, Maura Cerioli
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 7 months ago
On Termination for Faulty Channel Machines
A channel machine consists of a finite controller together with several fifo channels; the controller can read messages from the head of a channel and write messages to the tail of...
Patricia Bouyer, Nicolas Markey, Joël Ouaknin...
18
Voted
ENTCS
2008
102views more  ENTCS 2008»
13 years 7 months ago
Programming Languages For Interactive Computing
Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination...
Roly Perera
CORR
2011
Springer
190views Education» more  CORR 2011»
12 years 11 months ago
Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems
We describe a system for specifying the effects of actions. Unlike those commonly used in AI planning, our system uses an action description language that allows one to specify t...
Fangzhen Lin
SIGSOFT
2007
ACM
14 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...