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