Sciweavers

8699 search results - page 214 / 1740
» Elements of the Theory of Computation
Sort
View
BIRTHDAY
2010
Springer
15 years 7 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
LICS
2005
IEEE
16 years 5 days ago
Proof Theory for Kleene Algebra
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...
Chris Hardin
IWFM
2003
123views Formal Methods» more  IWFM 2003»
15 years 8 months ago
Derivation of Distributed Programs in the Theory of Owicki and Gries: An Example
This paper describes the derivation of a program for the propagation of information over a network, with acknowledgement (feedback) when the computation is complete. The derivatio...
Doug Goldson
CHI
2011
ACM
14 years 10 months ago
Comparing activity theory with distributed cognition for video analysis: beyond "kicking the tires"
The field of HCI is growing, not only in the variety of application areas or the volume of research conducted, but also in the number of analytical approaches for use in the evalu...
Eric P. S. Baumer, Bill Tomlinson
ICALP
2004
Springer
15 years 12 months ago
Deciding Knowledge in Security Protocols Under Equational Theories
The analysis of security protocols requires precise formulations of the knowledge of protocol participants and attackers. In formal approaches, this knowledge is often treated in t...
Martín Abadi, Véronique Cortier