Result 241 to 260 of 362 total
Resolution trees with lemmas: resolution refinements that characterize DLL algorithms with clause learning. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 13, 28 p., electronic only (2008).
241
A rational deconstruction of Landin’s SECD machine with the J operator. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 12, 67 p., electronic only (2008).
242
First-order and temporal logics for nested words. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 11, 44 p., electronic only (2008).
243
Coalgebraic automata theory: basic results. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 10, 43 p., electronic only (2008).
244
Compactly accessible categories and quantum key distribution. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 9, 26 p., electronic only (2008).
245
Multi-objective model checking of Markov decision processes. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 8, 21 p., electronic only (2008).
246
Recursive concurrent stochastic games. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 7, 21 p., electronic only (2008).
247
Flow faster: efficient decision algorithms for probabilistic simulations. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 6, 43 p., electronic only (2008).
248
Light logics and the call-by-value lambda calculus. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 5, 28 p., electronic only (2008).
249
Characterising testing preorders for finite probabilistic processes. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 4, 33 p., electronic only (2008).
250
Bisimilarity and behaviour-preserving reconfigurations of open Petri nets. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 3, 41 p., electronic only (2008).
251
Logical reasoning for higher-order functions with local state. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 2, 68 p., electronic only (2008).
252
Interpolation in local theory extensions. (English)
Log. Methods Comput. Sci. 4, No. 4, Paper 1, 31 p., electronic only (2008).
253
On the strength of proof-irrelevant type theories. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 13, 20 p., electronic only (2008).
254
Model checking probabilistic timed automata with one or two clocks. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 12, 28 p., electronic only (2008).
255
The complexity of enriched $μ$-calculi. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 11, 27 p., electronic only (2008).
256
Proving noninterference by a fully complete translation to the simply typed lambda-calculus. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 10, 31 p., electronic only (2008).
257
Rational streams coalgebraically. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 9, 22 p., electronic only (2008).
258
Consistency and completeness of rewriting in the calculus of constructions. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 8, 20 p., electronic only (2008).
259
Game refinement relations and metrics. (English)
Log. Methods Comput. Sci. 4, No. 3, Paper 7, 28 p., electronic only (2008).
260
Result 241 to 260 of 362 total
Start
Contact
Print
General Help
