Foundations of algebraic specification and formal software development.
From MaRDI portal
Publication:610397
zbMath1237.68129MaRDI QIDQ610397
Donald Sannella, Andrzej Tarlecki
Publication date: 8 December 2010
Published in: Monographs in Theoretical Computer Science. An EATCS Series (Search for Journal in Brave)
Abstract data types; algebraic specification (68Q65) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (61)
Logical relations and parametricity -- a Reynolds programme for category theory and programming languages ⋮ A Proof Theoretic Interpretation of Model Theoretic Hiding ⋮ Behavioral equivalence of hidden \(k\)-logics: an abstract algebraic approach ⋮ Infinitary rewriting: closure operators, equivalences and models ⋮ Dynamic Logic with Binders and Its Application to the Development of Reactive Systems ⋮ Building Specifications in the Event-B Institution ⋮ Term-Generic Logic ⋮ Logical systems. I: Internal calculi. ⋮ Nominative data with ordered set of names ⋮ Composition-nominative logics as institutions ⋮ Functorial semantics of first-order views ⋮ Specification of systems with parameterised events: An institution-independent approach ⋮ Essential concepts of algebraic specification and program development ⋮ Parameterisation for abstract structured specifications ⋮ Modularity of Ontologies in an Arbitrary Institution ⋮ Introducing \(H\), an institution-based formal specification and verification language ⋮ Institutions for SQL database schemas and datasets ⋮ Term charters ⋮ The Distributed Ontology, Modeling and Specification Language – DOL ⋮ Glushkov's algorithmic algebras and automated parallel computing design ⋮ Foundations for structuring behavioural specifications ⋮ Preservation in many-valued truth institutions ⋮ Graded consequence: an institution theoretic study ⋮ Software tools for automation of parallel programming on the basis of algebra of algorithms ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Partialising institutions ⋮ Integrating ADTs in KeY and their application to history-based reasoning about collection ⋮ An axiomatic approach to structuring specifications ⋮ Parallel rewriting of attributed graphs ⋮ On the existence of translations of structured specifications ⋮ Comorphisms of structured institutions ⋮ Towards the flexible reuse of model transformations: a formal approach based on graph transformation ⋮ Refinement by Interpretation in a General Setting ⋮ Observational interpretations of hybrid dynamic logic with binders and silent transitions ⋮ Monographs, a category of graph structures ⋮ CafeOBJ Traces ⋮ Parchments for CafeOBJ Logics ⋮ Observational Refinement Process ⋮ Symbolic execution based on language transformation ⋮ Manifest domains: analysis and description ⋮ The institution-theoretic scope of logic theorems ⋮ On the algebra of structured specifications ⋮ A logic for the stepwise development of reactive systems ⋮ Exception tracking in an open world ⋮ Behavioural and abstractor specifications revisited ⋮ CoFI with Don Sannella ⋮ Toward formal development of programs from algebraic specifications: Model-theoretic foundations ⋮ Semantics of multiway dataflow constraint systems ⋮ Hybrid dynamic logic institutions for event/data-based systems ⋮ Generic constructions for behavioral specifications ⋮ Van Kampen Colimits and Path Uniqueness ⋮ MiniBrass: soft constraints for MiniZinc ⋮ Formalization of universal algebra in Agda ⋮ Abstract Constraint Data Types ⋮ Institutions for OCL-Like Expression Languages ⋮ Towards an Institutional Framework for Heterogeneous Formal Development in UML ⋮ The Foundational Legacy of ASL ⋮ CASL: the Common Algebraic Specification Language. ⋮ Implicit Partiality of Signature Morphisms in Institution Theory ⋮ Generalised graded interpolation ⋮ Refinement in hybridised institutions
Uses Software
This page was built for publication: Foundations of algebraic specification and formal software development.
