Sciweavers

1894 search results - page 284 / 379
» A TLA Proof System
Sort
View
121
Voted
ENTCS
2007
100views more  ENTCS 2007»
15 years 3 months ago
Type-Safe Code Transformations in Haskell
The use of typed intermediate languages can significantly increase the reliability of a compiler. By typechecking the code produced at each transformation stage, one can identify...
Louis-Julien Guillemette, Stefan Monnier
140
Voted
IJAR
2007
86views more  IJAR 2007»
15 years 3 months ago
Non-deterministic semantics for logics with a consistency operator
In order to handle inconsistent knowledge bases in a reasonable way, one needs a logic which allows nontrivial inconsistent theories. Logics of this sort are called paraconsistent...
Arnon Avron
114
Voted
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
15 years 2 months ago
Balancing state-space coverage in planning with dynamics
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...
Yanbo Li, Kostas E. Bekris
SIGSOFT
2010
ACM
15 years 1 months ago
Software economies
Software construction has typically drawn on engineering metaphors like building bridges or cathedrals, which emphasize architecture, specification, central planning, and determin...
David F. Bacon, Eric Bokelberg, Yiling Chen, Ian A...
POPL
2005
ACM
16 years 4 months ago
Context logic and tree update
Spatial logics have been used to describe properties of treelike structures (Ambient Logic) and in a Hoare style to reason about dynamic updates of heap-like structures (Separatio...
Cristiano Calcagno, Philippa Gardner, Uri Zarfaty