Search results for "TAPSOFT"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
1	Iabelle Biermann, Brigitte Rozoy	Reliable Generalized and Context Dependent Commutation Relations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	S. Purushothaman Iyer, Murali Narasimha	Probabilistic Lossy Channel Systems.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Sébastien Limet, Pierre Réty	E-Unification by Means of Tree Tuple Synchronized Grammars.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Henrik Reif Andersen, Jørgen Staunstrup, Niels Maretti	A Comparison of Modular Verification Techniques.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Eric Goubault	Optimal Implementation of Wait-Free Binary Relations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Yves Andre, Francis Bossut	Word-into-Tree Transducers with Bounded Difference.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	J. B. Wells, Allyn Dimock, Robert Muller, Franklyn A. Turbak	A Typed Intermediate Language for Flow-Directed Compilation.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	E. Allen Emerson, Richard J. Trefler	Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Salvatore La Torre, Margherita Napoli, Mimmo Parente	Synchronization of a Line of Identical Processors at a Given Time.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Thomas Schreiber	Auxiliary Variables and Recursive Procedures.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Pascal Caron	AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Marina Lenisa	A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	T. S. E. Maibaum	Conservative Extensions, Interpretations Between Theories and All That!	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Judicaël Courant	An Applicative Module Calculus.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Chuck C. Liang	Let-Polymorphism and Eager Type Schemes.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Jan Phillips, Peter Scholz	Compositional Specification of Embedded Systems with Statecharts.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Michael Baldamus, Jürgen Dingel	Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract).	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Gary T. Leavens, Jeannette M. Wing	Protective Interface Specifications.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Jean-Pierre Talpin	Reactive Types.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Daniel Leivant, Jean-Yves Marion	Predicative Functional Recurrence and Poly-space.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	José Luiz Fiadeiro, Antónia Lopes	Semantics of Architectural Connectors.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Robert Muth, Saumya K. Debray	On the Complexity of Function Pointer May-Alias Analysis.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Sabrina Mantaci, Daniele Micciancio	An Algorithm for the Solution of Tree Equations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Fabio Alessi, Paolo Baldan, Furio Honsell	Partializing Stone Spaces using SFP Domains (Extended Abstract).	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Adel Bouhoula, Jean-Pierre Jouannaud, José Meseguer 0001	Specification and Proof in Membership Equational Logic.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema	Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Corrado Böhm	Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper).	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Franck van Breugel	A Labelled Transition Systems for pi-epsilon-Calculus.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Puri Arenas-Sánchez, Mario Rodríguez-Artalejo	A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Donald Sannella	What Does the Future Hold for Theoretical Computer Science?	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Michael R. Donat	Automating Formal Specification-Based Testing.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Kåre J. Kristoffersen, François Laroussinie, Kim Guldstrand Larsen, Paul Pettersson, Wang Yi 0001	A Compositional Proof of a Real-Time Mutual Exclusion Protocol.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Mark Richters, Martin Gogolla	A Web-based Animator for Object Specifications in a Persistent Environment.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Dennis M. Volpano, Geoffrey Smith 0001	A Type-Based Approach to Program Security.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Frédéric Voisin	A new Proof-Manager and Graphic Interface for the Larch Prover.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Jonathan C. Martin, Andy King	Generating Efficient, Terminating Logic Programs.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Lubos Mikusiak, Miroslav Adámy, Thomas Seidmann	Publishing Formal Specifications in Z Notation on World Wide Web.	TAPSOFT	1997	DBLP DOI BibTeX RDF	Netscape plug-in, ActiveX control, WWW, formal specification, Z notation, LaTeX
1	Staffan Bonnier, Tim Heyer	COMPASS: A Comprehensible Assertion Method.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Wolfgang Reif, Gerhard Schellhorn, Kurt Stenzel	Proving System Correctness with KIV.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Klaus Didrich, Torsten Klein	DOSFOP - A Documentation Tool for the Algebraic Programming Language OPAL.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Friedrich W. von Henke, Marko Luther, Martin Strecker	Typelab: An Environment for Modular Program Development.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Martín Abadi, K. Rustan M. Leino	A Logic of Object-Oriented Programs.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Hartmut Ehrig, Bernd Mahr	Future Trends of TAPSOFT.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Wolfgang Thomas	Automata Theory on Trees and Partial Orders.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Michel Bidoit, Max Dauchet (eds.)	TAPSOFT'97: Theory and Practice of Software Development, 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Olaf Müller, Tobias Nipkow	Traces of I/O-Automata in Isabelle/HOLCF.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Aleksy Schubert	Linear Interpolation for the Higher-Order Matching Problem.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Rocco De Nicola, Gian-Luigi Ferrari 0002, Rosario Pugliese	Locality Based Linda: Programming with Explicit Localities.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Wolfgang May	Specifying Complex and Structured Systems with Evolving Algebras.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Tomas Kovacs, Andrzej Lingas	Maximum Packing for Biconnected Outerplanar Graphs.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Viviana Bono, Michele Bugliesi, Mariangiola Dezani-Ciancaglini, Luigi Liquori	Subtyping Constraints for Incomplete Objects (Extended Abstract).	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Danièle Beauquier, Anatol Slissenko	The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Thomas Arts, Jürgen Giesl	Automatically Proving Termination Where Simplification Orderings Fail.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Vladimir Levin, Doron A. Peled	Verification of Message Sequence Charts via Template Matching.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Bruno Salinier, Robert Strandh	Simulating Forward-Branching Systems with Constructor Systems.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Thomas Genet, Isabelle Gnaedig	Termination Proofs Using gpo Ordering Constraints.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Peter Thiemann 0001	A Unified Framework for Binding-Time Analysis.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Bart Jacobs 0001	Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Irek Ulidowski, Iain C. C. Phillips	Formats of Ordered SOS Rules with Silent Actions.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Luc Moreau 0001	A Syntactic Theory of Dynamic Binding.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Kolyang 0001, Christoph Lüth, Thomas Meyer 0001, Burkhart Wolff	TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Ali Amaniss, Miki Hermann, Denis Lugiez	Set Operations for Recurrent Term Schematizations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Egidio Astesiano, Gianna Reggio	Formalism and Method.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Martin Müller 0001, Joachim Niehren, Andreas Podelski	Inclusion Constraints over Non-empty Sets of Trees.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Jean-Michel Ilié, Khalil Ajami	Model Checking Through Symbolic Reachability Graph.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Frits W. Vaandrager	A Theory of Testing for Timed Automata (Abstract).	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Arend Rensink, Roberto Gorrieri	Action Refinement as an Implementation Relations.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Franck Seynhaeve, Marc Tommasi, Ralf Treinen	Grid Structure and Undecidable Constraint Theories.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Toshiyuki Yamada, Jürgen Avenhaus, Carlos Loría-Sáenz, Aart Middeldorp	Logicality of Conditional Rewrite Systems.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Maurice Nivat	New Challenges for Theoretical Computer Science.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Peter D. Mosses	CoFI: The Common Framework Initiative for Algebraic Specification and Development.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Maritta Heisel, Nicole Lévy	Using LOTOS Patterns to Characterize Architectural Styles.	TAPSOFT	1997	DBLP DOI BibTeX RDF
1	Joseph A. Goguen, Luqi	Formal Methods and Social Context in Software Development.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Vladimiro Sassone	On the Category of Petri Net Computations.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Stephen L. Bloom, Zoltán Ésik	Nonfinite Axiomatizability of Shuffle Inequalities.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Martín Abadi, Luca Cardelli	An Imperative Object Calculus.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Bengt Jonsson 0001, Yih-Kuen Tsay	Assumption/Guarantee Specifications in Linear-Time Temporal Logic (Extended Abstract).	TAPSOFT	1995	DBLP DOI BibTeX RDF
1		B-Core: The B-Toolkit Demonstration.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Peter Ørbæk	Can you Trust your Data?	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Yves Bertot, Ranan Fraer	Reasoning with Executable Specifications.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Luc Moreau 0001	Non-Speculative and Upward Invocation of Continuations in a Parallel Language.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Marie-Claude Gaudel	Testing Can Be Formal, Too.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Xinxin Liu 0008, David Walker 0008	Confluence of Processes and Systems of Objects.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Peter D. Mosses, Mogens Nielsen, Michael I. Schwartzbach (eds.)	TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Kevin Lano	Reactive System Specification and Refinement.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Paul Le Guernic	Signal: A Formal Design Environment for Real-Time Systems.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Martin Hofmann 0001, Donald Sannella	On Behavioral Abstraction and Behavioural Satisfaction in Higher-Order Logic.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Isambo Karali, Constantin Halatsis	A Refinement of Import/Export Declarations in Modular Logic Programming and its Semantics.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Kirsten Lackner Solberg	Strictness and Totality Analysis with Conjunction.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Luiz Carlos Castro Guedes, Edward Hermann Haeusler, José Lucas Rangel	Object Oriented Semantics Directed Compiler Generation: A Prototype.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Shmuel Sagiv, Thomas W. Reps, Susan Horwitz	Precise Interprocedural Dataflow Analysis with Applications to Constant Propagation.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Annika Wagner	On the Expressive Power of Algebraic Graph Grammars with Application Conditions.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Satoshi Okui, Aart Middeldorp, Tetsuo Ida	Lazy Narrowing: Strong Completeness and Eager Variable Elimination (Extended Abstract).	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Éric Badouel, Luca Bernardinello, Philippe Darondeau	Polynomial Algorithms for the Synthesis of Bounded Nets.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Zohar Manna, Nikolaj S. Bjørner, Anca Browne, Edward Y. Chang, Michael Colón, Luca de Alfaro, Harish Devarajan, Arjun Kapur, Jaejin Lee, Henny Sipma, Tomás E. Uribe	STeP: The Stanford Temporal Prover.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	M. R. K. Krishna Rao	Semi-Completeness of Hierarchical and Super-Hierarchical Combinations of Term Rewriting Systems.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Thomas Wilke, Haiseung Yoo	Computing the Wadge Degree, the Lifschitz Degree, and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Henrik Reif Andersen, Michael Mendler	Describing a Signal Analyzer in the Process Algebra PMC - A Case Study.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Kai Salomaa	Decidability of Equivalence for Deterministic Synchronized Tree Automata.	TAPSOFT	1995	DBLP DOI BibTeX RDF
1	Pierre-André Wacrenier	Semi-Trace Morphisms and Rational Transductions.	TAPSOFT	1995	DBLP DOI BibTeX RDF

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