Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algebraic System Specification and Development [[electronic resource] ] : A Survey and Annotated Bibliography / / edited by Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella
| Algebraic System Specification and Development [[electronic resource] ] : A Survey and Annotated Bibliography / / edited by Michel Bidoit, Hans-Jörg Kreowski, Pierre Lescanne, Fernando Orejas, Donald Sannella |
| Edizione | [1st ed. 1991.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 |
| Descrizione fisica | 1 online resource (XII, 184 p.) |
| Disciplina | 004.2/1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer organization
Computer Systems Organization and Communication Networks |
| ISBN | 3-540-47382-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Basic foundations -- Models and logics -- Development concepts -- Support tools -- Applications. |
| Record Nr. | UNISA-996465945103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1991 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Recent Trends in Data Type Specification [[electronic resource] ] : 8th Workshop on Specification of Abstract Data Types joint with the 3rd COMPASS Workshop, Dourdan, France, August 26-30, 1991. Selected Papers / / edited by Michel Bidoit, Christine Choppy
| Recent Trends in Data Type Specification [[electronic resource] ] : 8th Workshop on Specification of Abstract Data Types joint with the 3rd COMPASS Workshop, Dourdan, France, August 26-30, 1991. Selected Papers / / edited by Michel Bidoit, Christine Choppy |
| Edizione | [1st ed. 1993.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 |
| Descrizione fisica | 1 online resource (X, 346 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Data structures (Computer science) Computers Programming languages (Electronic computers) Computer logic Software Engineering/Programming and Operating Systems Data Structures and Information Theory Theory of Computation Software Engineering Programming Languages, Compilers, Interpreters Logics and Meanings of Programs |
| ISBN | 3-540-47545-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Algebraic specification of concurrency -- Objects and their specification -- The use of sorts in algebraic specifications -- Implementation and behavioural equivalence: A survey -- Relationships between logical frameworks -- Label algebras: A systematic use of terms -- How to specify non determinism and true concurrency with algebraic term nets -- Bounded implementation of algebraic specifications -- New concepts of amalgamation and extension for a general theory of specifications -- Nonequivalence of categories for equational algebraic specifications -- Process semantics of temporal logic specification -- The object-based specification language ?: concepts, syntax, and semantics -- Specifications with observable formulae and observational satisfaction relation -- Event logic for specifying abstract dynamic data types -- A soft stairway to institutions -- Generic classes in an object-based language. |
| Record Nr. | UNISA-996466087803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1993 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
TAPSOFT'97: Theory and Practice of Software Development [[electronic resource] ] : 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings / / edited by Michel Bidoit, Max Dauchet
| TAPSOFT'97: Theory and Practice of Software Development [[electronic resource] ] : 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings / / edited by Michel Bidoit, Max Dauchet |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVI, 892 p.) |
| Disciplina | 005.1/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer science—Mathematics Programming languages (Electronic computers) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-68517-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical Computer Science and software science: The past, the present and the future (position paper) -- Future trends of TAPSOFT -- New challenges for theoretical computer science -- What does the future hold for theoretical computer science? -- Automata theory on trees and partial orders -- A theory of testing for timed automata -- Conservative extensions, interpretations between theories and all that! -- Specification and proof in membership equational logic -- Formalism and method -- CoFI: The common framework initiative for algebraic specification and development -- Logicality of conditional rewrite systems -- Simulating forward-branching systems with constructor systems -- Reliable generalized and context dependent commutation relations -- Word-into-Trees Transducers with bounded difference -- Generalized quantitative temporal reasoning: An automata-theoretic approach -- The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages -- Model checking through symbolic reachability graph -- Optimal implementation of wait-free binary relations -- Relative undecidability in the termination hierarchy of single rewrite rules -- Termination proofs using gpo ordering constraints -- Automatically proving termination where simplification orderings fail -- Generating efficient, terminating logic programs -- Modal characterization of weak bisimulation for higher-order processes -- Formats of ordered SOS rules with silent actions -- A uniform syntactical method for proving coinduction principles in ?-calculi -- A labelled transition system for ??-calculus -- Set operations for recurrent term schematizations -- Inclusion constraints over non-empty sets of trees -- Grid structures and undecidable constraint theories -- Predicative functional recurrence and poly-space -- On the complexity of function pointer may-alias analysis -- Maximum packing for biconnected outerplanar graphs -- Synchronization of a line of identical processors at a given time -- An algorithm for the solution of tree equations -- E-unification by means of tree tuple synchronized grammars -- Linear interpolation for the higher-order matching problem -- A semantic framework for functional logic programming with algebraic polymorphic types -- Subtyping constraints for incomplete objects -- Partializing stone spaces using SFP domains -- Let-polymorphism and eager type schemes -- Semantics of architectural connectors -- Protective interface specifications -- Specifying complex and structured systems with Evolving Algebras -- A comparison of modular verification techniques -- A compositional proof of a real-time mutual exclusion protocol -- Traces of I/O-automata in Isabelle/HOLCF -- Reactive types -- A type-based approach to program security -- An applicative module calculus -- Compositional specification of embedded systems with Statecharts -- Verification of message sequence charts via template matching -- Probabilistic lossy channel systems -- A logic of object-oriented programs -- Auxiliary variables and recursive procedures -- Locality based Linda: Programming with explicit localities -- A syntactic theory of dynamic binding -- A unified framework for binding-time analysis -- A typed intermediate language for flow-directed compilation -- Action refinement as an implementation relation -- Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs -- COMPASS: A comprehensible assertion method -- Using LOTOS patterns to characterize architectural styles -- Automating formal specification-based testing -- TYPELAB: An environment for modular program development -- TAS and IsaWin: Generic interfaces for transformational program development and theorem proving -- Proving system correctness with KIV -- A new proof-manager and graphic interface for the Larch Prover -- A web-based animator for object specifications in a persistent environment -- Publishing formal specifications in Z notation on world wide web -- DOSFOP — A documentation tool for the algebraic programming language Opal -- AG: A set of maple packages for symbolic computing of automata and semigroups. |
| Record Nr. | UNISA-996465992303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
TAPSOFT'97: Theory and Practice of Software Development [[electronic resource] ] : 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings / / edited by Michel Bidoit, Max Dauchet
| TAPSOFT'97: Theory and Practice of Software Development [[electronic resource] ] : 7th International Joint Conference CAAP/FASE, Lille, France, April 14-18, 1997, Proceedings / / edited by Michel Bidoit, Max Dauchet |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XVI, 892 p.) |
| Disciplina | 005.1/2 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer science—Mathematics Programming languages (Electronic computers) Software Engineering/Programming and Operating Systems Symbolic and Algebraic Manipulation Programming Languages, Compilers, Interpreters |
| ISBN | 3-540-68517-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Theoretical Computer Science and software science: The past, the present and the future (position paper) -- Future trends of TAPSOFT -- New challenges for theoretical computer science -- What does the future hold for theoretical computer science? -- Automata theory on trees and partial orders -- A theory of testing for timed automata -- Conservative extensions, interpretations between theories and all that! -- Specification and proof in membership equational logic -- Formalism and method -- CoFI: The common framework initiative for algebraic specification and development -- Logicality of conditional rewrite systems -- Simulating forward-branching systems with constructor systems -- Reliable generalized and context dependent commutation relations -- Word-into-Trees Transducers with bounded difference -- Generalized quantitative temporal reasoning: An automata-theoretic approach -- The Railroad Crossing Problem: Towards semantics of timed algorithms and their model checking in high level languages -- Model checking through symbolic reachability graph -- Optimal implementation of wait-free binary relations -- Relative undecidability in the termination hierarchy of single rewrite rules -- Termination proofs using gpo ordering constraints -- Automatically proving termination where simplification orderings fail -- Generating efficient, terminating logic programs -- Modal characterization of weak bisimulation for higher-order processes -- Formats of ordered SOS rules with silent actions -- A uniform syntactical method for proving coinduction principles in ?-calculi -- A labelled transition system for ??-calculus -- Set operations for recurrent term schematizations -- Inclusion constraints over non-empty sets of trees -- Grid structures and undecidable constraint theories -- Predicative functional recurrence and poly-space -- On the complexity of function pointer may-alias analysis -- Maximum packing for biconnected outerplanar graphs -- Synchronization of a line of identical processors at a given time -- An algorithm for the solution of tree equations -- E-unification by means of tree tuple synchronized grammars -- Linear interpolation for the higher-order matching problem -- A semantic framework for functional logic programming with algebraic polymorphic types -- Subtyping constraints for incomplete objects -- Partializing stone spaces using SFP domains -- Let-polymorphism and eager type schemes -- Semantics of architectural connectors -- Protective interface specifications -- Specifying complex and structured systems with Evolving Algebras -- A comparison of modular verification techniques -- A compositional proof of a real-time mutual exclusion protocol -- Traces of I/O-automata in Isabelle/HOLCF -- Reactive types -- A type-based approach to program security -- An applicative module calculus -- Compositional specification of embedded systems with Statecharts -- Verification of message sequence charts via template matching -- Probabilistic lossy channel systems -- A logic of object-oriented programs -- Auxiliary variables and recursive procedures -- Locality based Linda: Programming with explicit localities -- A syntactic theory of dynamic binding -- A unified framework for binding-time analysis -- A typed intermediate language for flow-directed compilation -- Action refinement as an implementation relation -- Behaviour-refinement of coalgebraic specifications with coinductive correctness proofs -- COMPASS: A comprehensible assertion method -- Using LOTOS patterns to characterize architectural styles -- Automating formal specification-based testing -- TYPELAB: An environment for modular program development -- TAS and IsaWin: Generic interfaces for transformational program development and theorem proving -- Proving system correctness with KIV -- A new proof-manager and graphic interface for the Larch Prover -- A web-based animator for object specifications in a persistent environment -- Publishing formal specifications in Z notation on world wide web -- DOSFOP — A documentation tool for the algebraic programming language Opal -- AG: A set of maple packages for symbolic computing of automata and semigroups. |
| Record Nr. | UNINA-9910768447503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||