LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
100
click to vote
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
Hoare logic is bedevilled by complex but coarse side conditions on the use of variables. We define a logic, free of side conditions, which permits more precise statements of a pr...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
Treewidth measures the ”tree-likeness” of structures. Many NP-complete problems, e.g., propositional satisfiability, are tractable on bounded-treewidth structures. In this wo...
114
click to vote
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We present an expressiveness study of linearity and persistence of processes. We choose the π-calculus, one of the main representatives of process calculi, as a framework to cond...
LICS
2006
IEEE
15 years 4 months ago
2006
IEEE
We consider the monadic boundedness problem for least fixed points over FO formulae as a decision problem: Given a formula ϕ(X, x), positive in X, decide whether there is a unif...