Proceedings of the Seventh International Joint Conference on Theory and Practice of Software Development
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter

Michel Bidoit, Max Dauchet
Proceedings of the Seventh International Joint Conference on Theory and Practice of Software Development
TAPSOFT CAAP/FASE, 1997.

TCS
DBLP
Scholar
DOI
Full names Links ISxN
@proceedings{TAPSOFT-1997,
	doi           = "10.1007/BFb0030581",
	editor        = "Michel Bidoit and Max Dauchet",
	isbn          = "3-540-62781-2",
	publisher     = "{Springer}",
	series        = "{Lecture Notes in Computer Science}",
	title         = "{Proceedings of the Seventh International Joint Conference on Theory and Practice of Software Development}",
	volume        = 1214,
	year          = 1997,
}

Contents (71 items)

TAPSOFT-1997-Bohm
Theoretical Computer Science and Software Science: The Past, the Present and the Future (Position Paper) (CB), pp. 3–5.
TAPSOFT-1997-EhrigM #roadmap
Future Trends of TAPSOFT (HE, BM), pp. 6–10.
TAPSOFT-1997-Nivat #challenge
New Challenges for Theoretical Computer Science (MN), pp. 11–14.
TAPSOFT-1997-Sanella #question #what
What Does the Future Hold for Theoretical Computer Science? (DS), pp. 15–19.
TAPSOFT-1997-Thomas #automaton #partial order
Automata Theory on Trees and Partial Orders (WT), pp. 20–38.
TAPSOFT-1997-Vaandrager #automaton #formal method #testing
A Theory of Testing for Timed Automata (Abstract) (FWV), p. 39.
TAPSOFT-1997-Maibaum #exclamation
Conservative Extensions, Interpretations Between Theories and All That! (TSEM), pp. 40–66.
TAPSOFT-1997-BouhoulaJM #equation #logic #proving #specification
Specification and Proof in Membership Equational Logic (AB, JPJ, JM), pp. 67–92.
TAPSOFT-1997-AstesianoR
Formalism and Method (EA, GR), pp. 93–114.
TAPSOFT-1997-Mosses #algebra #development #framework #named #specification
CoFI: The Common Framework Initiative for Algebraic Specification and Development (PDM), pp. 115–137.
TAPSOFT-1997-YamadaALM #term rewriting
Logicality of Conditional Rewrite Systems (TY, JA, CLS, AM), pp. 141–152.
TAPSOFT-1997-SalinierS #simulation
Simulating Forward-Branching Systems with Constructor Systems (BS, RS), pp. 153–164.
TAPSOFT-1997-BiermannR #reliability
Reliable Generalized and Context Dependent Commutation Relations (IB, BR), pp. 165–176.
TAPSOFT-1997-AndreB #bound #difference #transducer
Word-into-Tree Transducers with Bounded Difference (YA, FB), pp. 177–188.
TAPSOFT-1997-EmersonT #approach #automaton #reasoning
Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach (EAE, RJT), pp. 189–200.
TAPSOFT-1997-BeauquierS #algorithm #model checking #problem #semantics #towards
The Railroad Crossing Problem: Towards Semantics of Timed Algorithms and Their Model Checking in High Level Languages (DB, AS), pp. 201–212.
TAPSOFT-1997-IlieA #graph #model checking #reachability
Model Checking Through Symbolic Reachability Graph (JMI, KA), pp. 213–224.
TAPSOFT-1997-Goubault #implementation
Optimal Implementation of Wait-Free Binary Relations (EG), pp. 225–236.
TAPSOFT-1997-GeserMOZ #termination
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules (AG, AM, EO, HZ), pp. 237–248.
TAPSOFT-1997-GenetG #constraints #proving #termination #using
Termination Proofs Using gpo Ordering Constraints (TG, IG), pp. 249–260.
TAPSOFT-1997-ArtsG #automation #order #proving #termination
Automatically Proving Termination Where Simplification Orderings Fail (TA, JG), pp. 261–272.
TAPSOFT-1997-MartinK #generative #logic programming #performance #source code
Generating Efficient, Terminating Logic Programs (JCM, AK), pp. 273–284.
TAPSOFT-1997-BaldamusD #bisimulation #higher-order #process
Modal Characterization of Weak Bisimulation for Higher-order Processes (Extended Abstract) (MB, JD), pp. 285–296.
TAPSOFT-1997-UlidowskiP #order
Formats of Ordered SOS Rules with Silent Actions (IU, ICCP), pp. 297–308.
TAPSOFT-1997-Lenisa #induction #proving #λ-calculus
A Uniform Syntactical Method for Proving Coinduction Principles in Lambda-Calculi (ML), pp. 309–320.
TAPSOFT-1997-Breugel #calculus #lts
A Labelled Transition Systems for pi-epsilon-Calculus (FvB), pp. 321–332.
TAPSOFT-1997-AmanissHL #set
Set Operations for Recurrent Term Schematizations (AA, MH, DL), pp. 333–344.
TAPSOFT-1997-MullerNP #constraints #set
Inclusion Constraints over Non-empty Sets of Trees (MM0, JN, AP), pp. 345–356.
TAPSOFT-1997-SeynhaeveTT #constraints #decidability #grid
Grid Structure and Undecidable Constraint Theories (FS, MT, RT), pp. 357–368.
TAPSOFT-1997-LeivantM #functional
Predicative Functional Recurrence and Poly-space (DL, JYM), pp. 369–380.
TAPSOFT-1997-MuthD #alias #analysis #complexity #on the #pointer
On the Complexity of Function Pointer May-Alias Analysis (RM, SKD), pp. 381–392.
TAPSOFT-1997-KovacL #graph
Maximum Packing for Biconnected Outerplanar Graphs (TK, AL), pp. 393–404.
TAPSOFT-1997-TorreNP
Synchronization of a Line of Identical Processors at a Given Time (SLT, MN, MP), pp. 405–416.
TAPSOFT-1997-MantaciM #algorithm #equation
An Algorithm for the Solution of Tree Equations (SM, DM), pp. 417–428.
TAPSOFT-1997-LimetR #tuple
E-Unification by Means of Tree Tuple Synchronized Grammars (SL, PR), pp. 429–440.
TAPSOFT-1997-Schubert #higher-order #linear #problem
Linear Interpolation for the Higher-Order Matching Problem (AS), pp. 441–452.
TAPSOFT-1997-Arenas-SanchezR #algebra #framework #functional #logic programming #polymorphism #semantics
A Semantic Framework for Functional Logic Programming with Algebraic Polymorphic Types (PAS, MRA), pp. 453–464.
TAPSOFT-1997-BonoBDL #constraints #type system
Subtyping Constraints for Incomplete Objects (Extended Abstract) (VB, MB, MDC, LL), pp. 465–477.
TAPSOFT-1997-AlessiBH #using
Partializing Stone Spaces using SFP Domains (Extended Abstract) (FA, PB, FH), pp. 478–489.
TAPSOFT-1997-Liang #morphism
Let-Polymorphism and Eager Type Schemes (CL), pp. 490–501.
TAPSOFT-1997-FiadeiroL #architecture #semantics
Semantics of Architectural Connectors (JLF, AL), pp. 505–519.
TAPSOFT-1997-LeavensW #interface #specification
Protective Interface Specifications (GTL, JMW), pp. 520–534.
TAPSOFT-1997-May #algebra #evolution #specification
Specifying Complex and Structured Systems with Evolving Algebras (WM), pp. 535–549.
TAPSOFT-1997-AndersenSM #comparison #composition #verification
A Comparison of Modular Verification Techniques (HRA, JS, NM), pp. 550–564.
TAPSOFT-1997-KristoffersenLLPY #composition #protocol #proving #realtime
A Compositional Proof of a Real-Time Mutual Exclusion Protocol (KJK, FL, KGL, PP, WY0), pp. 565–579.
TAPSOFT-1997-MullerN #higher-order
Traces of I/O-Automata in Isabelle/HOLCF (OM, TN), pp. 580–594.
TAPSOFT-1997-Talpin
Reactive Types (JPT), pp. 595–606.
TAPSOFT-1997-VolpanoS #approach #security #type system
A Type-Based Approach to Program Security (DMV, GS), pp. 607–621.
TAPSOFT-1997-Courant #calculus
An Applicative Module Calculus (JC), pp. 622–636.
TAPSOFT-1997-PhillipsS #composition #embedded #specification
Compositional Specification of Embedded Systems with Statecharts (JP, PS), pp. 637–651.
TAPSOFT-1997-LevinP #sequence chart #verification
Verification of Message Sequence Charts via Template Matching (VL, DAP), pp. 652–666.
TAPSOFT-1997-IyerN #probability
Probabilistic Lossy Channel Systems (SPI, MN), pp. 667–681.
TAPSOFT-1997-AbadiL #logic #object-oriented #source code
A Logic of Object-Oriented Programs (MA, KRML), pp. 682–696.
TAPSOFT-1997-Schreiber #recursion
Auxiliary Variables and Recursive Procedures (TS), pp. 697–711.
TAPSOFT-1997-NicolaFP #locality #programming
Locality Based Linda: Programming with Explicit Localities (RDN, GLF, RP), pp. 712–726.
TAPSOFT-1997-Moreau
A Syntactic Theory of Dynamic Binding (LM0), pp. 727–741.
TAPSOFT-1997-Thiemann #analysis #framework
A Unified Framework for Binding-Time Analysis (PT), pp. 742–756.
TAPSOFT-1997-WellsDMT #compilation
A Typed Intermediate Language for Flow-Directed Compilation (JBW, AD, RM, FAT), pp. 757–771.
TAPSOFT-1997-RensinkG #implementation #refinement
Action Refinement as an Implementation Relations (AR, RG), pp. 772–786.
TAPSOFT-1997-Jacobs #algebra #behaviour #correctness #induction #proving #specification
Behaviour-Refinement of Coalgebraic Specifications with Coinductive Correctness Proofs (BJ0), pp. 787–802.
TAPSOFT-1997-BonnierH #named
COMPASS: A Comprehensible Assertion Method (SB, TH), pp. 803–817.
TAPSOFT-1997-HeiselL #architecture #using
Using LOTOS Patterns to Characterize Architectural Styles (MH, NL), pp. 818–832.
TAPSOFT-1997-Donat #automation #testing
Automating Formal Specification-Based Testing (MRD), pp. 833–847.
TAPSOFT-1997-HenkeLS #composition #development #named
Typelab: An Environment for Modular Program Development (FWvH, ML, MS), pp. 851–854.
TAPSOFT-1997-KolyangLMW #development #interface #proving #theorem proving
TAS and IsaWin: Generic Interfaces for Transformational Program Development and Theorem Proving (K0, CL, TM0, BW), pp. 855–858.
TAPSOFT-1997-ReifSS #correctness #proving
Proving System Correctness with KIV (WR, GS, KS), pp. 859–862.
TAPSOFT-1997-Voisin #interface #proving
A new Proof-Manager and Graphic Interface for the Larch Prover (FV), pp. 863–866.
TAPSOFT-1997-RichtersG #persistent #specification
A Web-based Animator for Object Specifications in a Persistent Environment (MR, MG), pp. 867–870.
TAPSOFT-1997-MikusiakAS #specification #web
Publishing Formal Specifications in Z Notation on World Wide Web (LM, MA, TS), pp. 871–874.
TAPSOFT-1997-DidrichK #algebra #documentation #programming language
DOSFOP - A Documentation Tool for the Algebraic Programming Language OPAL (KD, TK), pp. 875–878.
TAPSOFT-1997-Caron #automaton #named #set
AG: A Set of Maple Packages for Symbolic Computing of Automata and Semigroups (PC), pp. 879–882.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.