Result 1 to 20 of 362 total
Petri net reachability graphs: decidability status of first order properties. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 10, 28 p. (2012).
1
Off-line test selection with test purposes for non-deterministic timed automata. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 9, 33 p. (2012).
2
On Berry’s conjectures about the stable order in PCF. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 7, 39 p. (2012).
3
Parameterised multiparty session types. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 6, 46 p. (2012).
4
Essential convexity and complexity of semi-algebraic constraints. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 5, 25 p. (2012).
5
On streams that are finitely red. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 4, 20 p. (2012).
6
Full abstraction for the resource lambda calculus with tests, through Taylor expansion. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 3, 44 p. (2012).
7
Linear-use CPS translations in the enriched effect calculus. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 2, 27 p. (2012).
8
First steps in synthetic guarded domain theory: step-indexing in the topos of trees. (English)
Log. Methods Comput. Sci. 8, No. 4, Paper No. 1, 45 p. (2012).
9
Complexity classifications for different equivalence and audit problems for Boolean circuits. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 31, 25 p. (2012).
10
URSA: a system for uniform reduction to SAT. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 30, 39 p. (2012).
11
Invariant generation through strategy iteration in succinctly represented control flow graphs. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 29, 35 p. (2012).
12
Forward analysis for WSTS. II: Complete WSTS. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 28, 35 p. (2012).
13
Applying CEGAR to the Petri net state equation. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 27, 20 p. (2012).
14
Piecewise testable tree languages. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 26, 32 p. (2012).
15
Predicate generation for learning-based quantifier-free loop invariant inference. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 25, 21 p. (2012).
16
Degrees of lookahead in regular infinite games. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 24, 15 p. (2012).
17
Reachability analysis of communicating pushdown systems. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 23, 20 p. (2012).
18
Two for the price of one: lifting separation logic assertions. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 22, 31 p., electronic only (2012).
19
Model checking the quantitative $μ$-calculus on linear hybrid systems. (English)
Log. Methods Comput. Sci. 8, No. 3, Paper No. 21, 24 p., electronic only (2012).
20
Result 1 to 20 of 362 total
Start
Contact
Print
General Help
