Sciweavers

7988 search results - page 138 / 1598
» A Useful Undecidable Theory
Sort
View
LICS
1999
IEEE
14 years 2 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
BIRTHDAY
2008
Springer
14 years 8 days ago
Unfolding Graph Transformation Systems: Theory and Applications to Verification
The unfolding of a system represents in a single branching structure all its possible computations: it is the cornerstone both of semantical constructions and of efficient partial ...
Paolo Baldan, Andrea Corradini, Barbara König
DLT
2003
13 years 11 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer
KRDB
2003
139views Database» more  KRDB 2003»
13 years 11 months ago
Expressing Transactions with Savepoints as Non-Markovian Theories of Actions
Flat transactions with savepoints are a variation of the classical flat transactions that allows the user to go undo work done so far back to a certain point within the transacti...
Iluju Kiringa, Alfredo Gabaldon
EJC
2000
13 years 11 months ago
Towards a Theory of Epistemic Information
Abstract: The concept of information is still lacking a complete understanding, as witnessed by the large number of different meanings that overload the terms "data", &qu...
Stefano Mizzaro