Archives

RS57 Diagnostic ModelChecking for RealTime Systems
No. 57 (1996) 
RS60 UPPAAL in 1995
No. 60 (1996) 
RS61 Proof of a Conjecture of S. Mac Lane
No. 61 (1996) 
RS03 A Definability Theorem for First Order Logic
No. 3 (1997) 
RS04 Bisimulation for Labelled Markov Processes
No. 4 (1997) 
RS08 Dynamic Linear Time Temporal Logic
No. 8 (1997) 
RS11 Timed Modal Specification —Theory and Tools
No. 11 (1997) 
RS13 Compositional Safety Logics
No. 13 (1997) 
RS15 Bistructures, Bidomains and Linear Logic
No. 15 (1997) 
RS16 Linear Hashing
No. 16 (1997) 
RS18 How to Believe a MachineChecked Proof
No. 18 (1997) 
RS20 Classifying Toposes for First Order Theories
No. 20 (1997) 
RS21 Topological Completeness for HigherOrder Logic
No. 21 (1997) 
RS24 Relational Reasoning about Contexts
No. 24 (1997) 
RS26 A Characterization of Finitary Bisimulation
No. 26 (1997) 
RS30 Proof Theory and Computational Analysis
No. 30 (1997) 
RS33 A Note on Frame Distributions
No. 33 (1997) 
RS34 Presheaf Models for the piCalculus
No. 34 (1997) 
RS36 Relational Semantics of NonDeterministic Dataflow
No. 36 (1997) 
RS40 Quantum Entanglement and Communication Complexity
No. 40 (1997) 
RS42 On the NoCounterexample Interpretation
No. 42 (1997) 
RS44 On the Density of Normal Bases in Finite Fields
No. 44 (1997) 
RS45 What Is a ‘Good’ Encoding of Guarded Choice?
No. 45 (1997) 
RS46 HigherOrder Rewriting and Partial Evaluation
No. 46 (1997) 
RS47 Distributed Safety Controllers for Web Services
No. 47 (1997) 
RS49 CASL for ASF+SDF Users
No. 49 (1997) 
RS51 Some Lambda Calculus and Type Theory Formalized
No. 51 (1997) 
RS52 On the Finitary Characterization of piCongruences
No. 52 (1997) 
RS53 Online TypeDirected Partial Evaluation
No. 53 (1997) 
RS01 A Simple Solution to Type Specialization
No. 1 (1998) 
RS03 Comparison of Coding DNA
No. 3 (1998) 
RS04 Timed Bisimulation and Open Maps
No. 4 (1998) 
RS07 Marked Ancestor Problems (Preliminary Version)
No. 7 (1998) 
RS10 Optimal TimeSpace TradeOffs for Sorting
No. 10 (1998) 
RS11 Lower Bounds for Dynamic Algebraic Problems
No. 11 (1998) 
RS12 Functional Unparsing
No. 12 (1998) 
RS13 Compiling Actions by Partial Evaluation, Revisited
No. 13 (1998) 
RS14 The Hardness of Speedingup Knapsack
No. 14 (1998) 
RS21 A Representation Result for Free Cocompletions
No. 21 (1998) 
RS22 A Categorical Axiomatics for Bisimulation
No. 22 (1998) 
RS23 Martingales and Locality in Distributed Computing
No. 23 (1998) 
RS25 Talagrand’s Inequality in Hereditary Settings
No. 25 (1998) 
RS26 On Encoding p pi in m pi
No. 26 (1998) 
RS27 A Group Signature Scheme Based on an RSAVariant
No. 27 (1998) 
RS30 Finitely Presented Heyting Algebras
No. 30 (1998) 
RS31 A Linear Metalanguage for Concurrency
No. 31 (1998) 
RS38 An nary zipWith in Haskell
No. 38 (1998) 
RS42 Semantics, Modularity, and Rewriting Logic
No. 42 (1998) 
RS43 CASL: A Guided Tour of its Design
No. 43 (1998) 
RS44 Towards Reusable RealTime Objects
No. 44 (1998) 
RS46 Clock Difference Diagrams
No. 46 (1998) 
RS50 Testing HennessyMilner Logic with Recursion
No. 50 (1998) 
RS51 Automated Modeling of RealTime Implementation
No. 51 (1998) 
RS52 Imperative Objects and Mobile Processes
No. 52 (1998) 
RS01 Dynamic Algorithms for the Dyck Languages
No. 1 (1995) 
RS02 From Timed Automata to Logic and Back
No. 2 (1995) 
RS04 Petri Nets and Bisimulations
No. 4 (1995) 
RS08 Type Inference of Turbo Pascal
No. 8 (1995) 
RS12 Fast Meldable Priority Queues
No. 12 (1995) 
RS13 The Girard Translation Extended with Recursion
No. 13 (1995) 
RS15 The Fourth Moment in Luby's Distribution
No. 15 (1995) 
RS17 Design Architectures through Category Constraints
No. 17 (1995) 
RS18 Complexity Results for Model Checking
No. 18 (1995) 
RS19 Compositional Model Checking of Real Time Systems
No. 19 (1995) 
RS20 The Constructive Lift Monad
No. 20 (1995) 
RS21 MONA: Monadic SecondOrder Logic in Practice
No. 21 (1995) 
RS23 Open Maps (at) Work
No. 23 (1995) 
RS24 Can you Trust your Data?
No. 24 (1995) 
RS25 Basic Action Theory
No. 25 (1995) 
RS27 Automata for the mucalculus and Related Results
No. 27 (1995) 
RS29 An n log n Algorithm for Online BDD Refinement
No. 29 (1995) 
RS30 From Branching to Linear Metric Domains (and back)
No. 30 (1995) 
RS31 Trust in the lambdacalculus
No. 31 (1995) 
RS32 Efficient Inference of Object Types
No. 32 (1995) 
RS33 Type Inference with Nonstructural Subtyping
No. 33 (1995) 
RS34 Type Inference with Selftype
No. 34 (1995) 
RS36 Nonprimitive Recursive Function Definitions
No. 36 (1995) 
RS37 Experiments with ZF Set Theory in HOL and Isabelle
No. 37 (1995) 
RS39 Petri Nets, Traces, and Local Model Checking
No. 39 (1995) 
RS48 Simple Proofs of Occupancy Tail Bounds
No. 48 (1995) 
RS50 On Competitive OnLine Paging with Lookahead
No. 50 (1995) 
RS51 A TemporalLogic Approach to BindingTime Analysis
No. 51 (1995) 
RS52 Deciding Regularity in Process Algebras
No. 52 (1995) 
RS56 Axiomatizing Prefix Iteration with Silent Steps
No. 56 (1995) 
RS57 Topological Aspects of Traces
No. 57 (1995) 
RS59 On the Finitary Bisimulation
No. 59 (1995) 
RS3 The Modified Realizability Topos
No. 3 (1996) 
RS8 Bisimulations for Asynchronous Mobile Processes
No. 8 (1996) 
RS16 Detecting Deadlocks in Concurrent Systems
No. 16 (1996) 
RS17 EtaExpansion Does The Trick (Revised Version)
No. 17 (1996) 
RS19 Thunks and the lambdaCalculus
No. 19 (1996) 
RS20 Back to Direct Style II: FirstClass Continuations
No. 20 (1996) 
RS25 Balls and Bins: A Study in Negative Dependence
No. 25 (1996) 
RS26 BDD Algortihms and Cache Misses
No. 26 (1996) 
RS27 Negative Dependence Through the FKG Inequality
No. 27 (1996) 
RS32 Regular Trace Event Structures
No. 32 (1996) 
RS35 Presheaf Models for Concurrency
No. 35 (1996) 
RS37 Optimal Purely Functional Priority Queues
No. 37 (1996) 
RS38 Objects as Mobile Processes
No. 38 (1996) 
RS44 A Presheaf Semantics of ValuePassing Processes
No. 44 (1996) 
RS45 Statistical Secrecy and MultiBit Commitments
No. 45 (1996) 
RS49 Objects, Types and Modal Logics
No. 49 (1996) 
RS51 Rn and Gn Logics
No. 51 (1996) 
RS53 Theory and Practice of Action Semantics
No. 53 (1996) 
RS54 Pushdown Processes: Games and Model Checking
No. 54 (1996) 
RS5 Observational MuCalculus
No. 5 (1999) 
RS6 Measures on Hidden Markov Models
No. 6 (1999) 
RS9 A Runtime System for Interactive Web Services
No. 9 (1999) 
RS11 On the Uniform Weak König’s Lemma
No. 11 (1999) 
RS12 Finding Maximal Pairs with Bounded Gap
No. 12 (1999) 
RS14 Weak Bisimulation and Open Maps
No. 14 (1999) 
RS16 Protein Folding in the 2D HP Model
No. 16 (1999) 
RS23 On proving syntactic properties of CPS programs
No. 23 (1999) 
RS25 Finding Maximal Quasiperiodicities in Strings
No. 25 (1999) 
RS26 An Expressive Extension of TLC
No. 26 (1999) 
RS29 A Complexity Gap for TreeResolution
No. 29 (1999) 
RS30 Structural Operational Semantics
No. 30 (1999) 
RS31 Foundational and Mathematical Uses of Higher Types
No. 31 (1999) 
RS36 Presheaf Models for CCSlike Languages
No. 36 (1999) 
RS37 Constrained EdgeSplitting Problems
No. 37 (1999) 
RS38 Linear Time Recognition of P4Indifferent Graphs
No. 38 (1999) 
RS41 Verification of State/Event Systems by Quotienting
No. 41 (1999) 
RS42 Decoding Choice Encodings
No. 42 (1999) 
RS43 What is a ‘Good’ Encoding of Guarded Choice?
No. 43 (1999) 
RS44 Aliasing Models for Mobile Objects
No. 44 (1999) 
RS48 Faster Deterministic Dictionaries
No. 48 (1999) 
RS52 Towards a Theory of Regular MSC Languages
No. 52 (1999) 
RS54 Foundations of Modular SOS
No. 54 (1999) 
RS55 Logical Specification of Operational Semantics
No. 55 (1999) 
RS56 A Modular SOS for Action Notation
No. 56 (1999) 
RS57 A Modular SOS for ML Concurrency Primitives
No. 57 (1999) 
RS1 Pseudoknots in RNA Secondary Structures
No. 1 (2000) 
RS2 Local Logics for Traces
No. 2 (2000) 
RS4 A New Tradeoff for Deterministic Dictionaries
No. 4 (2000) 
RS10 A Tough Nut for Tree Resolution
No. 10 (2000) 
RS19 A Note on NP intersection coNP/poly
No. 19 (2000) 
RS22 Using Automata in Control Synthesis. A Case Study
No. 22 (2000) 
RS23 Characteristic Formulae for Timed Automata
No. 23 (2000) 
RS24 Growing Languages with Metamorphic Syntax Macros
No. 24 (2000) 
RS27 Inductive * Semirings
No. 27 (2000) 
RS28 Free mulattices
No. 28 (2000) 
RS33 A HigherOrder Colon Translation
No. 33 (2000) 
RS35 CPS Transformation of BetaRedexes
No. 35 (2000) 
RS36 Dispersing Hash Functions
No. 36 (2000) 
RS39 The Pointer Assertion Logic Engine
No. 39 (2000) 
RS40 MONA Implementation Secrets
No. 40 (2000) 
RS41 The DSD Schema Language and its Applications
No. 41 (2000) 
RS42 The bigwig Project
No. 42 (2000) 
RS49 Higher Order Reverse Mathematics
No. 49 (2000) 
RS50 Modularity in MetaLanguages
No. 50 (2000) 
RS51 CASL for CafeOBJ Users
No. 51 (2000) 
RS52 How to Convert a Flavor of Quantum Bit Commitment
No. 52 (2000) 
RS7 On the Number of QuasiKernels in Digraphs
No. 7 (2001) 
RS9 Static Validation of Dynamically Generated HTML
No. 9 (2001) 
RS10 Do we Need Dependent Types?
No. 10 (2001) 
RS13 Events in Security Protocols
No. 13 (2001) 
RS46 Lower Bounds for Monotone Span Programs
No. 46 (1994) 
RS45 Automatic Synthesis of Real Time Systems
No. 45 (1994)
1350 of 670
Next