van Bakel, Steffen; Fernández, Maribel Normalization, approximation, and semantics for combinator systems. (English) Zbl 1019.68059 Theor. Comput. Sci. 290, No. 1, 975-1019 (2003). MSC: 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Rönkkö, Mauno; Ravn, Anders P.; Sere, Kaisa Hybrid action systems. (English) Zbl 1019.68054 Theor. Comput. Sci. 290, No. 1, 937-973 (2003). MSC: 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Gori, Roberta An abstract interpretation framework to reason on finite failure and other properties of finite and infinite computations. (English) Zbl 1051.68103 Theor. Comput. Sci. 290, No. 1, 863-936 (2003). MSC: 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Laurence, Michael R.; Danicic, Sebastian; Harman, Mark; Hierons, Rob; Howroyd, John Equivalence of conservative, free, linear program schemas is decidable. (English) Zbl 1019.68011 Theor. Comput. Sci. 290, No. 1, 831-862 (2003). MSC: 68N01 × Cite Format Result Cite Review PDF Full Text: DOI
Caucal, Didier On infinite transition graphs having a decidable monadic theory. (English) Zbl 1019.68066 Theor. Comput. Sci. 290, No. 1, 79-115 (2003). MSC: 68Q85 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Fu, Yuxi; Yang, Zhenrong Understanding the mismatch combinator in chi calculus. (English) Zbl 1019.68067 Theor. Comput. Sci. 290, No. 1, 779-830 (2003). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Laneve, Cosimo A type system for JVM threads. (English) Zbl 1019.68013 Theor. Comput. Sci. 290, No. 1, 741-778 (2003). MSC: 68N15 × Cite Format Result Cite Review PDF Full Text: DOI
Amadio, Roberto M.; Lugiez, Denis; Vanackère, Vincent On the symbolic reduction of processes with cryptographic functions. (English) Zbl 1051.68054 Theor. Comput. Sci. 290, No. 1, 695-740 (2003). MSC: 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Calders, T.; Paredaens, J. Axiomatization of frequent itemsets. (English) Zbl 1019.68034 Theor. Comput. Sci. 290, No. 1, 669-693 (2003). MSC: 68P15 × Cite Format Result Cite Review PDF Full Text: DOI
Bernardinello, Luca; Ferigato, Carlo; Pomello, Lucia An algebraic model of observable properties in distributed systems. (English) Zbl 1019.68004 Theor. Comput. Sci. 290, No. 1, 637-668 (2003). MSC: 68M14 68T27 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Alessi, Fabio; Baldan, Paolo; Honsell, Furio A category of compositional domain-models for separable Stone spaces. (English) Zbl 1051.68102 Theor. Comput. Sci. 290, No. 1, 599-635 (2003). MSC: 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Stomp, Frank Correctness of substring-preprocessing in Boyer-Moore’s pattern matching algorithm. (English) Zbl 1018.68050 Theor. Comput. Sci. 290, No. 1, 59-78 (2003). MSC: 68Q65 × Cite Format Result Cite Review PDF Full Text: DOI
de Alfaro, Luca; Kapur, Arjun Hybrid diagrams. (English) Zbl 1029.68119 Theor. Comput. Sci. 290, No. 1, 565-597 (2003). MSC: 68T01 × Cite Format Result Cite Review PDF Full Text: DOI
Zhu, Zhaohui; Li, Bin; Xiao, Xi’an; Chen, Shifu; Zhu, Wujia A representation theorem for recovering contraction relations satisfying wci. (English) Zbl 1019.68106 Theor. Comput. Sci. 290, No. 1, 545-564 (2003). MSC: 68T30 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Cousot, Patrick; Cousot, Radhia Parsing as abstract interpretation of grammar semantics. (English) Zbl 1019.68048 Theor. Comput. Sci. 290, No. 1, 531-544 (2003). MSC: 68Q42 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Chesñevar, Carlos Iván; Dix, Jürgen; Stolzenburg, Frieder; Simari, G. R. Guillermo Ricardo Relating defeasible and normal logic programming through transformation properties. (English) Zbl 1051.68043 Theor. Comput. Sci. 290, No. 1, 499-529 (2003). MSC: 68N17 × Cite Format Result Cite Review PDF Full Text: DOI
Maggiolo-Schettini, Andrea; Peron, Adriano; Tini, Simone A comparison of Statecharts step semantics. (English) Zbl 1018.68045 Theor. Comput. Sci. 290, No. 1, 465-498 (2003). MSC: 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Nakazawa, Koji Confluency and strong normalizability of call-by-value \(\lambda \mu\)-calculus. (English) Zbl 1018.68016 Theor. Comput. Sci. 290, No. 1, 429-463 (2003). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Barbanera, Franco; Berardi, Stefano A full continuous model of polymorphism. (English) Zbl 1018.68015 Theor. Comput. Sci. 290, No. 1, 407-428 (2003). MSC: 68N18 × Cite Format Result Cite Review PDF Full Text: DOI
Bravetti, M.; Aldini, A. Discrete time generative-reactive probabilistic processes with different advancing speeds. (English) Zbl 1018.68051 Theor. Comput. Sci. 290, No. 1, 355-406 (2003). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Tinelli, Cesare; Ringeissen, Christophe Unions of non-disjoint theories and combinations of satisfiability procedures. (English) Zbl 1018.68033 Theor. Comput. Sci. 290, No. 1, 291-353 (2003). MSC: 68Q25 68T20 × Cite Format Result Cite Review PDF Full Text: DOI
Lucanu, Dorel Relaxed models for rewriting logic. (English) Zbl 1018.68036 Theor. Comput. Sci. 290, No. 1, 265-289 (2003). MSC: 68Q42 × Cite Format Result Cite Review PDF Full Text: DOI
Abdulla, Parosh Aziz; Jonsson, Bengt Model checking of systems with many identical timed processes. (English) Zbl 1018.68046 Theor. Comput. Sci. 290, No. 1, 241-264 (2003). MSC: 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Mukund, Madhavan; Narayan Kumar, K.; Sohoni, Milind Bounded time-stamping in message-passing systems. (English) Zbl 1018.68003 Theor. Comput. Sci. 290, No. 1, 221-239 (2003). MSC: 68M14 × Cite Format Result Cite Review PDF Full Text: DOI
Valentini, Silvio A cartesian closed category in Martin-Löf’s intuitionistic type theory. (English) Zbl 1018.68078 Theor. Comput. Sci. 290, No. 1, 189-219 (2003). MSC: 68T27 03B15 03B20 × Cite Format Result Cite Review PDF Full Text: DOI
Laurent, Olivier Polarized proof-nets and \(\lambda \mu\)-calculus. (English) Zbl 1019.68021 Theor. Comput. Sci. 290, No. 1, 161-188 (2003). MSC: 68N18 03B40 03F07 03F52 × Cite Format Result Cite Review PDF Full Text: DOI
Bernardo, Marco; Bravetti, Mario Performance measure sensitive congruences for Markovian process algebras. (English) Zbl 1019.68065 Theor. Comput. Sci. 290, No. 1, 117-160 (2003). MSC: 68Q85 × Cite Format Result Cite Review PDF Full Text: DOI
Coquand, Thierry A syntactical proof of the Marriage Lemma. (English) Zbl 1051.03048 Theor. Comput. Sci. 290, No. 1, 1107-1113 (2003). MSC: 03F20 03B35 05A05 × Cite Format Result Cite Review PDF Full Text: DOI
Martinelli, Fabio Analysis of security protocols as open systems. (English) Zbl 1019.68039 Theor. Comput. Sci. 290, No. 1, 1057-1106 (2003). MSC: 68P25 × Cite Format Result Cite Review PDF Full Text: DOI
Pichler, Reinhard Explicit versus implicit representations of subsets of the Herbrand universe. (English) Zbl 1051.68061 Theor. Comput. Sci. 290, No. 1, 1021-1056 (2003). MSC: 68Q01 × Cite Format Result Cite Review PDF Full Text: DOI
Mavronicolas, Marios; Papadakis, Nikos Trade-off results for connection management. (English) Zbl 1008.68010 Theor. Comput. Sci. 290, No. 1, 1-57 (2003). MSC: 68M12 68M14 × Cite Format Result Cite Review PDF Full Text: DOI