FEEDBACK Smiley face
Normal view MARC view ISBD view

Foundations of Software Science and Computation Structures [electronic resource] :Second International Conference, FOSSACS’99 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS’99 Amsterdam, The Netherlands,March 22–28, 1999 Proceedings /

Contributor(s): Thomas, Wolfgang [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 1578Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1999.Description: X, 330 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540490197.Subject(s): Computer science | Software engineering | Programming languages (Electronic computers) | Computers | Computer logic | Mathematical logic | Computer Science | Software Engineering/Programming and Operating Systems | Logics and Meanings of Programs | Mathematical Logic and Formal Languages | Computation by Abstract Devices | Programming Languages, Compilers, Interpreters | Software EngineeringOnline resources: Click here to access online
Contents:
Security Protocols and Specifications -- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis -- Reasoning about Concurrent Systems Using Types -- Testing Hennessy-Milner Logic with Recursion -- A Strong Logic Programming View for Static Embedded Implications -- Unfolding and Event Structure Semantics for Graph Grammars -- Expanding the Cube -- An Algebraic Characterization of Typability in ML with Subtyping -- Static Analysis of Processes for No Read-Up and No Write-Down -- A WP-calculus for OO -- The Recognizability Problem for Tree Automata with Comparisons between Brothers -- A Theory of “May” Testing for Asynchronous Languages -- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees -- Categorical Models of Explicit Substitutions -- Equational Properties of Mobile Ambients -- Model Checking Logics for Communicating Sequential Agents -- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects -- String Languages Generated by Total Deterministic Macro Tree Transducers -- Matching Specifications for Message Sequence Charts -- Probabilistic Temporal Logics via the Modal Mu-Calculus -- A ?-calculus Process Semantics of Concurrent Idealised ALGOL.
In: Springer eBooks
Tags from this library: No tags from this library for this title. Add tag(s)
Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Security Protocols and Specifications -- An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis -- Reasoning about Concurrent Systems Using Types -- Testing Hennessy-Milner Logic with Recursion -- A Strong Logic Programming View for Static Embedded Implications -- Unfolding and Event Structure Semantics for Graph Grammars -- Expanding the Cube -- An Algebraic Characterization of Typability in ML with Subtyping -- Static Analysis of Processes for No Read-Up and No Write-Down -- A WP-calculus for OO -- The Recognizability Problem for Tree Automata with Comparisons between Brothers -- A Theory of “May” Testing for Asynchronous Languages -- A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees -- Categorical Models of Explicit Substitutions -- Equational Properties of Mobile Ambients -- Model Checking Logics for Communicating Sequential Agents -- A Complete Coinductive Logical System for Bisimulation Equivalence on Circular Objects -- String Languages Generated by Total Deterministic Macro Tree Transducers -- Matching Specifications for Message Sequence Charts -- Probabilistic Temporal Logics via the Modal Mu-Calculus -- A ?-calculus Process Semantics of Concurrent Idealised ALGOL.

There are no comments for this item.

Log in to your account to post a comment.

© IIIT-Delhi, 2013 | Phone: +91-11-26907510| FAX +91-11-26907405 | E-mail: library@iiitd.ac.in