Sciweavers

1799 search results - page 90 / 360
» The Logic of Correctness in Software Engineering
Sort
View
FSTTCS
1999
Springer
15 years 10 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
AMAST
2004
Springer
15 years 9 months ago
Refining Mobile UML State Machines
We study the semantics and refinement of mobile objects, considering an extension of core UML state machines by primitives that designate the location of objects and their moves wi...
Alexander Knapp, Stephan Merz, Martin Wirsing
160
Voted
PLDI
2010
ACM
15 years 10 months ago
Bringing Extensibility to Verified Compilers
Verified compilers, such as Leroy's CompCert, are accompanied by a fully checked correctness proof. Both the compiler and proof are often constructed with an interactive proo...
Zachary Tatlock, Sorin Lerner
258
Voted
SLOGICA
2011
15 years 1 months ago
Logics for Qualitative Inductive Generalization
The paper contains a survey of (mainly unpublished) adaptive logics of inductive generalization. These defeasible logics are precise formulations of certain methods. Some attentio...
Diderik Batens
LCTRTS
2005
Springer
15 years 11 months ago
Transparent distribution of real-time components based on logical execution time
This paper introduces the notion of transparent distribution of real time software components. Transparent distribution means that (1) the functional and temporal behavior of a sy...
Emilia Farcas, Claudiu Farcas, Wolfgang Pree, Jose...