Search results for "TACS"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Kazunori Ueda	Resource-Passing Concurrent Programming.	TACS	2001	DBLP DOI BibTeX RDF
1	Didier Galmiche, Daniel Méry	Proof-Search and Countermodel Generation in Propositional BI Logic.	TACS	2001	DBLP DOI BibTeX RDF
1	Lennart Beringer	Typing Assembly Programs with Explicit Forwarding.	TACS	2001	DBLP DOI BibTeX RDF
1	Daisuke Hoshina, Eijiro Sumii, Akinori Yonezawa	A Typed Process Calculus for Fine-Grained Resource Access Control in Distributed Computation.	TACS	2001	DBLP DOI BibTeX RDF
1	Barbara König 0001, Ugo Montanari	Observational Equivalence for Synchronized Graph Rewriting with Mobility.	TACS	2001	DBLP DOI BibTeX RDF
1	Martín Abadi, Jan Jürjens	Formal Eavesdropping and Its Computational Interpretation.	TACS	2001	DBLP DOI BibTeX RDF
1	Benjamin C. Pierce, Jerome Vouillon	Unison: A File Synchronizer and Its Specification.	TACS	2001	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Joost N. Kok	Infinite Intersection and Union Types for the Lazy Lambda Calculus.	TACS	2001	DBLP BibTeX RDF
1	Andrew M. Pitts	Nominal Logic: A First Order Theory of Names and Binding.	TACS	2001	DBLP BibTeX RDF
1	Luís Caires, Luca Cardelli	A Spatial Logic for Concurrency.	TACS	2001	DBLP DOI BibTeX RDF
1	Naoki Kobayashi 0001, Benjamin C. Pierce (eds.)	Theoretical Aspects of Computer Software, 4th International Symposium, TACS 2001, Sendai, Japan, October 29-31, 2001, Proceedings	TACS	2001	DBLP DOI BibTeX RDF
1	Anindya Banerjee 0001, Nevin Heintze, Jon G. Riecke	Design and Correctness of Program Transformations Based on Control-Flow Analysis.	TACS	2001	DBLP DOI BibTeX RDF
1	Daniel Jackson 0001, Alan D. Fekete	Lightweight Analysis of Object Interactions.	TACS	2001	DBLP DOI BibTeX RDF
1	Joachim Niehren, Tim Priesnitz	Non-structural Subtype Entailment in Automata Theory.	TACS	2001	DBLP DOI BibTeX RDF
1	Daniel Leivant	Termination Proofs and Complexity Certification.	TACS	2001	DBLP DOI BibTeX RDF
1	Hiroshi Nakano	Fixed-Point Logic with the Approximation Modality and Its Kripke Completeness.	TACS	2001	DBLP DOI BibTeX RDF
1	Philip Wadler	The Girard-Reynolds Isomorphism.	TACS	2001	DBLP BibTeX RDF
1	Mizuhito Ogawa	Generation of a Linear Time Query Processing Algorithm Based on Well-Quasi-Orders.	TACS	2001	DBLP DOI BibTeX RDF
1	Philippe Schnoebelen	Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems.	TACS	2001	DBLP DOI BibTeX RDF
1	Michele Bugliesi, Giuseppe Castagna, Silvia Crafa	Boxed Ambients.	TACS	2001	DBLP DOI BibTeX RDF
1	Cosimo Laneve, Joachim Parrow, Björn Victor	Solo Diagrams.	TACS	2001	DBLP BibTeX RDF
1	Makoto Hamana	A Logic Programming Language Based on Binding Algebras.	TACS	2001	DBLP BibTeX RDF
1	Martin Fränzle	What Will Be Eventually True of Polynomial Hybrid Automata?	TACS	2001	DBLP DOI BibTeX RDF	State recurrence, Progress properties, Verification procedures, Hybrid systems, Decidability
1	Andrei Serjantov, Peter Sewell, Keith Wansbrough	The UDP Calculus: Rigorous Semantics for Real Networking.	TACS	2001	DBLP DOI BibTeX RDF
1	Keye Martin	A Renee Equation for Algorithmic Complexity.	TACS	2001	DBLP DOI BibTeX RDF
1	Christine Paulin-Mohring	Modelisation of Timed Automata in Coq.	TACS	2001	DBLP DOI BibTeX RDF
1	Javier Esparza, Antonín Kucera 0001, Stefan Schwoon	Model-Checking LTL with Regular Valuations for Pushdown Systems.	TACS	2001	DBLP DOI BibTeX RDF
1	Yoriyuki Yamagata	Strong Normalization of Second Order Symmetric Lambda-mu Calculus.	TACS	2001	DBLP BibTeX RDF
1	Antti Puhakka	Weakest Congruence Results Concerning "Any-Lock".	TACS	2001	DBLP DOI BibTeX RDF
1	Philippa Gardner, Masahito Hasegawa	Types and Models for Higher-Order Action Calculi.	TACS	1997	DBLP DOI BibTeX RDF
1	Yoshiki Kinoshita, Peter W. O'Hearn, John Power, Makoto Takeyama, Robert D. Tennent	An Axiomatic Approach to Binary Logical Relations with Applications to Data Refinement.	TACS	1997	DBLP DOI BibTeX RDF
1	Lars Birkedal, Robert Harper 0001	Relational Interpretations of Recursive Types in an operational Setting (Summary).	TACS	1997	DBLP DOI BibTeX RDF
1	Richard Mayr	Combining Petri Nets and PA-Processes.	TACS	1997	DBLP DOI BibTeX RDF
1	Martín Abadi	Secrecy by Typing inSecurity Protocols.	TACS	1997	DBLP DOI BibTeX RDF
1	Zena M. Ariola, Stefan Blom	Cyclic Lambda Calculi.	TACS	1997	DBLP DOI BibTeX RDF
1	Kim B. Bruce, Luca Cardelli, Benjamin C. Pierce	Comparing Object Encodings.	TACS	1997	DBLP DOI BibTeX RDF
1	Jean-Jacques Lévy	Some Results in the Joint-Calculus.	TACS	1997	DBLP DOI BibTeX RDF
1	Robin Milner	Strong Normalisation in Higher-Order Action Calculi.	TACS	1997	DBLP DOI BibTeX RDF
1	Kaisa Sere, Marina Waldén	Data Refinement and Remote Procedures.	TACS	1997	DBLP DOI BibTeX RDF
1	Samuel Boutin	Using Reflection to Build Efficient and Certified Decision Procedures.	TACS	1997	DBLP DOI BibTeX RDF
1	Benjamin Werner	Sets in Types, Types in Sets.	TACS	1997	DBLP DOI BibTeX RDF
1	Alexander Aiken, Edward L. Wimmers, Jens Palsberg	Optimal Representations of Polymorphic Types with Subtyping (Extended Abstract).	TACS	1997	DBLP DOI BibTeX RDF
1	Julia L. Lawall, Peter Thiemann 0001	Sound Specialization in the Presence of Computational Effects.	TACS	1997	DBLP DOI BibTeX RDF
1	Carolyn L. Talcott	Composable Semantic Models for Actor Theories.	TACS	1997	DBLP DOI BibTeX RDF
1	Erik Poll	System F with Width-Subtyping and Record Updating.	TACS	1997	DBLP DOI BibTeX RDF
1	Samson Abramsky, Simon J. Gay, Rajagopal Nagarajan	A Type-Theoretic Approach to Deadlock-Freedom of Asynchronous Systems.	TACS	1997	DBLP DOI BibTeX RDF
1	John Power, Hayo Thielecke	Environments, Continuation Semantics and Indexed Categories.	TACS	1997	DBLP DOI BibTeX RDF
1	Gérard P. Huet, Henri Laulhère	Finite-State Transducers as Regular Böhm Trees.	TACS	1997	DBLP DOI BibTeX RDF
1	Martín Abadi, Takayasu Ito (eds.)	Theoretical Aspects of Computer Software, Third International Symposium, TACS '97, Sendai, Japan, September 23-26, 1997, Proceedings	TACS	1997	DBLP DOI BibTeX RDF
1	Jacques Garrigue, Didier Rémy	Extending ML with Semi-Explicit Higher-Order Polymorphism.	TACS	1997	DBLP DOI BibTeX RDF
1	Seán Matthews	Extending a Logical Framework with a Modal Connective for Validity.	TACS	1997	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Joost N. Kok	Infinitary Domain Logic for Finitary Transition Systems.	TACS	1997	DBLP DOI BibTeX RDF
1	Mario Coppo, Ferruccio Damiani, Paola Giannini	On Strictness and Totality.	TACS	1997	DBLP DOI BibTeX RDF
1	Atsushi Ohori	Type System for Specializing Polymorphism.	TACS	1997	DBLP DOI BibTeX RDF
1	Julian Rathke, Matthew Hennessy	Local Model Checking for Value-Passing Processes (Extended Abstract).	TACS	1997	DBLP DOI BibTeX RDF
1	Satoshi Yamane, Kazuhiro Nakamura	Symbolic Model-Checking Method Based on Approximations and Binary Decision Diagrams for Real-Time Systems.	TACS	1997	DBLP DOI BibTeX RDF
1	Franco Barbanera, Stefano Berardi, Massimo Schivalocchi	"Classical" Programming-with-Proofs in lambdaPASym: An Analysis of Non-confluence.	TACS	1997	DBLP DOI BibTeX RDF
1	Kathleen Fisher, John C. Mitchell	Notes on Typed Object-Oriented Programming.	TACS	1994	DBLP DOI BibTeX RDF
1	Davide Sangiorgi	Locality and True-concurrency in Calculi for Mobile Processes.	TACS	1994	DBLP DOI BibTeX RDF
1	Yves Bertot, Gilles Kahn, Laurent Théry	Proof by Pointing.	TACS	1994	DBLP DOI BibTeX RDF
1	Amitavo Islam, Wesley Phoa	Categorical Models of Relational Databases I: Fibrational Formulation, Schema Integration.	TACS	1994	DBLP DOI BibTeX RDF
1	Kim Ritter Wagner	Abstract Pre-Orders.	TACS	1994	DBLP DOI BibTeX RDF
1	Henri Korver, Jan Springintveld	A Computer-Checked Verification of Milner's Scheduler.	TACS	1994	DBLP DOI BibTeX RDF
1	Adriano Peron, Andrea Maggiolo-Schettini	Transitions as Interrupts: A New Semantics for Timed Statecharts.	TACS	1994	DBLP DOI BibTeX RDF
1	Robert Cartwright, Matthias Felleisen	Extensible Denotational Language Specifications.	TACS	1994	DBLP DOI BibTeX RDF
1	Samson Abramsky, Pasquale Malacaria, Radha Jagadeesan	Full Abstraction for PCF.	TACS	1994	DBLP DOI BibTeX RDF
1	Hans Hüttel	Undecidable Equivalences for Basic Parallel Processes.	TACS	1994	DBLP DOI BibTeX RDF
1	Martín Abadi, Luca Cardelli	A Theory of Primitive Objects - Untyped and First-Order Systems.	TACS	1994	DBLP DOI BibTeX RDF
1	Ferruccio Damiani, Paola Giannini	A Decidable Intersection Type System based on Relevance.	TACS	1994	DBLP DOI BibTeX RDF
1	Jakob Rehof, Morten Heine Sørensen	The LambdaDelta-calculus.	TACS	1994	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	Simple Termination of Hierarchical Combinations of Term Rewriting Systems.	TACS	1994	DBLP DOI BibTeX RDF
1	Zohar Manna, Amir Pnueli	Temporal Verification Diagrams.	TACS	1994	DBLP DOI BibTeX RDF
1	Didier Rémy	Programming Objects with ML-ART, an Extension to ML with Abstract and Record Types.	TACS	1994	DBLP DOI BibTeX RDF
1	Max I. Kanovich	Petri Nets, Horn Programs, Linear Logic, and Vector Games.	TACS	1994	DBLP DOI BibTeX RDF
1	Masako Takahashi, Yohji Akama, Sachio Hirokawa	Normal Proofs and Their Grammar.	TACS	1994	DBLP DOI BibTeX RDF
1	Philippa Gardner	Discovering Needed Reductions Using Type Theory.	TACS	1994	DBLP DOI BibTeX RDF
1	Alain Hui-Bon-Hoa	Intuitionistic Resolution for a Logic Programming Language with Scoping Constructs.	TACS	1994	DBLP DOI BibTeX RDF
1	Paris C. Kanellakis, Dina Q. Goldin	Constraint Programming and Database Query Languages.	TACS	1994	DBLP DOI BibTeX RDF
1	Jon G. Riecke, Ramesh Subrahmanyam	Extensions to Type Systems Can Preserve Operational Equivalences.	TACS	1994	DBLP DOI BibTeX RDF
1	Mariangiola Dezani-Ciancaglini, Ugo de'Liguoro, Adolfo Piperno	Fully Abstract Semantics for Concurrent Lambda-calculus.	TACS	1994	DBLP DOI BibTeX RDF
1	Flemming M. Damm	Subtyping with Union Types, Intersection Types and Recursive Types.	TACS	1994	DBLP DOI BibTeX RDF
1	Ursula Goltz, Roberto Gorrieri, Arend Rensink	On Syntactic and Semantic Action Refinement.	TACS	1994	DBLP DOI BibTeX RDF
1	Zena M. Ariola, Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries	Syntactic Definitions of Undefined: On Defining the Undefined.	TACS	1994	DBLP DOI BibTeX RDF
1	D. J. B. Bosscher	Term Rewriting Properties of SOS Axiomatisations.	TACS	1994	DBLP DOI BibTeX RDF
1	Masahiko Sato 0001	A Purely Functional Language with Encapsulated Assignment.	TACS	1994	DBLP DOI BibTeX RDF
1	Franco Barbanera, Stefano Berardi	A Symmetric Lambda Calculus for "Classical" Program Extraction.	TACS	1994	DBLP DOI BibTeX RDF
1	Marcello M. Bonsangue, Joost N. Kok	Relating Multifunctions and Predicate Transformers through Closure Operators.	TACS	1994	DBLP DOI BibTeX RDF
1	Albert R. Meyer	Observing Truly Concurrent Processes.	TACS	1994	DBLP DOI BibTeX RDF
1	Douglas J. Howe, Scott D. Stoller	An Operational Approach to Combining Classical Set Theory and Functional Programming Languages.	TACS	1994	DBLP DOI BibTeX RDF
1	Wan J. Fokkink	The Tyft/Tyxt Format Reduces to Tree Rules.	TACS	1994	DBLP DOI BibTeX RDF
1	Akinori Yonezawa	Theory and Practice of Concurrent Object-Oriented Computing.	TACS	1994	DBLP DOI BibTeX RDF
1	Tatsurou Sekiguchi, Akinori Yonezawa	A Complete Type Inference System for Subtyped Recursive Types.	TACS	1994	DBLP DOI BibTeX RDF
1	Moshe Y. Vardi	Nontraditional Applications of Automata Theory.	TACS	1994	DBLP DOI BibTeX RDF
1	Masami Hagiya, John C. Mitchell (eds.)	Theoretical Aspects of Computer Software, International Conference TACS '94, Sendai, Japan, April 19-22, 1994, Proceedings	TACS	1994	DBLP DOI BibTeX RDF
1	Yan Mei Tang, Pierre Jouvelot	Separate Abstract Interpretation for Control-Flow Analysis.	TACS	1994	DBLP DOI BibTeX RDF
1	Kung Chen, Martin Odersky	A Type System for a Lambda Calculus with Assignments.	TACS	1994	DBLP DOI BibTeX RDF
1	Kohei Honda 0001, Nobuko Yoshida	Replication in Concurrent Combinators.	TACS	1994	DBLP DOI BibTeX RDF
1	Mark P. Jones	ML Typing, Explicit Polymorphism and Qualified Types.	TACS	1994	DBLP DOI BibTeX RDF
1	Hideki Tsuiki	A Normalizing Calculus with Overloading and Subtyping.	TACS	1994	DBLP DOI BibTeX RDF
1	Andrea Asperti, Cosimo Laneve	The Family Relation in Interaction Systems.	TACS	1994	DBLP DOI BibTeX RDF

Publications at "TACS"( http://dblp.L3S.de/Venues/TACS )