Sciweavers

1814 search results - page 117 / 363
» Extended First-Order Logic
Sort
View
LMCS
2006
119views more  LMCS 2006»
15 years 3 months ago
Semantics of Separation-Logic Typing and Higher-order Frame Rules for Algol-like Languages
We show how to give a coherent semantics to programs that are well-specified in a version of separation logic for a language with higher types: idealized algol extended with heaps ...
Lars Birkedal, Noah Torp-Smith, Hongseok Yang
125
Voted
POPL
2010
ACM
16 years 22 days ago
Structuring the verification of heap-manipulating programs
Most systems based on separation logic consider only restricted forms of implication or non-separating conjunction, as full support for these connectives requires a non-trivial no...
Aleksandar Nanevski, Josh Berdine, Viktor Vafeiadi...
LFCS
2009
Springer
15 years 10 months ago
Logic and Bounded-Width Rational Languages of Posets over Countable Scattered Linear Orderings
In this paper we consider languages of labelled N-free posets over countable and scattered linear orderings. We prove that a language of such posets is series-rational if and only ...
Nicolas Bedon
DALT
2004
Springer
15 years 8 months ago
Intensional Programming for Agent Communication
This article investigates the intensional programming paradigm for agent communication by introducing context as a first class object in the intensional programming language Lucid...
Vasu S. Alagar, Joey Paquet, Kaiyu Wan
117
Voted
CORR
2010
Springer
136views Education» more  CORR 2010»
15 years 3 months ago
On the Sets of Real Numbers Recognized by Finite Automata in Multiple Bases
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
Bernard Boigelot, Julien Brusten, Véronique...