Concurrency, Compositionality, and Correctness [[electronic resource] ] : Essays in Honor of Willem-Paul de Roever / / edited by Dennis Dams, Ulrich Hannemann, Martin Steffen |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (377 p. 94 illus.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Software engineering
Compilers (Computer programs) User interfaces (Computer systems) Human-computer interaction Computer science Machine theory Software Engineering Compilers and Interpreters User Interfaces and Human Computer Interaction Computer Science Logic and Foundations of Programming Theory of Computation Formal Languages and Automata Theory |
ISBN |
1-280-38555-3
9786613563477 3-642-11512-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Bibliography of Willem-Paul de Roever -- Playing Savitch and Cooking Games -- Compositionality: Ontology and Mereology of Domains -- Computer Science and State Machines -- A Small Step for Mankind -- On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention -- Explicit Fair Scheduling for Dynamic Control -- Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence -- Reasoning about Recursive Processes in Shared-Variable Concurrency -- Formal Semantics of a VDM Extension for Distributed Embedded Systems -- A Proof System for a PGAS Language -- Concurrent Objects à la Carte -- On the Power of Play-Out for Scenario-Based Programs -- Proving the Refuted: Symbolic Model Checkers as Proof Generators -- Meanings of Model Checking -- Smaller Abstractions for ?CTL* without Next -- Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment -- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules -- Automated Proofs for Asymmetric Encryption -- Counterexample Guided Path Reduction for Static Program Analysis. |
Record Nr. | UNISA-996465633803316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Concurrency, compositionality, and correctness : essays in honor of Willem-Paul de Roever / / Dennis Dams, Ulrich Hannemann, Martin Steffen (eds.) |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2010 |
Descrizione fisica | 1 online resource (377 p. 94 illus.) |
Disciplina | 004 |
Altri autori (Persone) |
DamsDennis
HannemannUlrich SteffenMartin |
Collana | Lecture notes in computer science |
Soggetto topico | Computer science |
ISBN |
1-280-38555-3
9786613563477 3-642-11512-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A Bibliography of Willem-Paul de Roever -- Playing Savitch and Cooking Games -- Compositionality: Ontology and Mereology of Domains -- Computer Science and State Machines -- A Small Step for Mankind -- On Trojan Horses of Thompson-Goerigk-Type, Their Generation, Intrusion, Detection and Prevention -- Explicit Fair Scheduling for Dynamic Control -- Synchronous Message Passing: On the Relation between Bisimulation and Refusal Equivalence -- Reasoning about Recursive Processes in Shared-Variable Concurrency -- Formal Semantics of a VDM Extension for Distributed Embedded Systems -- A Proof System for a PGAS Language -- Concurrent Objects à la Carte -- On the Power of Play-Out for Scenario-Based Programs -- Proving the Refuted: Symbolic Model Checkers as Proof Generators -- Meanings of Model Checking -- Smaller Abstractions for ?CTL* without Next -- Timing Verification of GasP Asynchronous Circuits: Predicted Delay Variations Observed by Experiment -- Integrated and Automated Abstract Interpretation, Verification and Testing of C/C++ Modules -- Automated Proofs for Asymmetric Encryption -- Counterexample Guided Path Reduction for Static Program Analysis. |
Record Nr. | UNINA-9910484657103321 |
Berlin ; ; New York, : Springer, c2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
FM 2009 : formal methods / / volume editors, Ana Cavalcanti, Dennis Dams |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin ; ; London, : Springer, c2009 |
Descrizione fisica | 1 online resource (XVII, 820 p.) |
Disciplina | 005.1 |
Altri autori (Persone) |
CavalcantiAna
DamsDennis |
Collana | Lecture notes in computer science |
Soggetto topico |
Computer software - Development
Formal methods (Computer science) System design - Mathematics |
ISBN | 3-642-05089-1 |
Classificazione |
DAT 310f
DAT 510f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Formal Methods for Privacy -- What Can Formal Methods Bring to Systems Biology? -- Guess and Verify – Back to the Future -- Verification, Testing and Statistics -- Security, Probability and Nearly Fair Coins in the Cryptographers’ Café -- Model Checking I -- Recursive Abstractions for Parameterized Systems -- Abstract Model Checking without Computing the Abstraction -- Three-Valued Spotlight Abstractions -- Fair Model Checking with Process Counter Abstraction -- Compositionality -- Systematic Development of Trustworthy Component Systems -- Partial Order Reductions Using Compositional Confluence Detection -- A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition -- Verification -- Abstract Specification of the UBIFS File System for Flash Memory -- Inferring Mealy Machines -- Formal Management of CAD/CAM Processes -- Concurrency -- Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way -- Symbolic Predictive Analysis for Concurrent Programs -- On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study -- Refinement -- Sums and Lovers: Case Studies in Security, Compositionality and Refinement -- Iterative Refinement of Reverse-Engineered Models by Model-Based Testing -- Model Checking Linearizability via Refinement -- Static Analysis -- It’s Doomed; We Can Prove It -- “Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis -- Field-Sensitive Value Analysis by Field-Insensitive Analysis -- Theorem Proving -- Making Temporal Logic Calculational: A Tool for Unification and Discovery -- A Tableau for CTL* -- Certifiable Specification and Verification of C Programs -- Formal Reasoning about Expectation Properties for Continuous Random Variables -- Semantics -- The Denotational Semantics of slotted-Circus -- Unifying Probability with Nondeterminism -- Towards an Operational Semantics for Alloy -- A Robust Semantics Hides Fewer Errors -- Special Track: Industrial Applications I -- Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks -- Formal Verification of Avionics Software Products -- Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study -- Object-Orientation -- Connecting UML and VDM++ with Open Tool Support -- Language and Tool Support for Class and State Machine Refinement in UML-B -- Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects -- Abstract Object Creation in Dynamic Logic -- Pointers -- Reasoning about Memory Layouts -- A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis -- Real-Time -- On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery -- Verifying Real-Time Systems against Scenario-Based Requirements -- Special Track: Tools and Industrial Applications II -- Formal Specification of a Cardiac Pacing System -- Automated Property Verification for Large Scale B Models -- Reduced Execution Semantics of MPI: From Theory to Practice -- Model Checking II -- A Metric Encoding for Bounded Model Checking -- An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method -- Verifying Information Flow Control over Unbounded Processes -- Specification and Verification of Web Applications in Rewriting Logic -- Industry-Day Abstracts -- Verifying the Microsoft Hyper-V Hypervisor with VCC -- Industrial Practice in Formal Methods: A Review -- Model-Based GUI Testing Using Uppaal at Novo Nordisk. |
Record Nr. | UNINA-9910483872003321 |
Berlin ; ; London, : Springer, c2009 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
FM 2009: Formal Methods [[electronic resource] ] : Second World Congress, Eindhoven, The Netherlands, November 2-6, 2009, Proceedings / / edited by Ana Cavalcanti, Dennis Dams |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XVII, 820 p.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
User interfaces (Computer systems) Computer logic Programming languages (Electronic computers) Computer programming Software Engineering Software Engineering/Programming and Operating Systems User Interfaces and Human Computer Interaction Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques |
Soggetto genere / forma |
Eindhoven (2009)
Kongress. |
ISBN | 3-642-05089-1 |
Classificazione |
DAT 310f
DAT 510f SS 4800 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Formal Methods for Privacy -- What Can Formal Methods Bring to Systems Biology? -- Guess and Verify – Back to the Future -- Verification, Testing and Statistics -- Security, Probability and Nearly Fair Coins in the Cryptographers’ Café -- Model Checking I -- Recursive Abstractions for Parameterized Systems -- Abstract Model Checking without Computing the Abstraction -- Three-Valued Spotlight Abstractions -- Fair Model Checking with Process Counter Abstraction -- Compositionality -- Systematic Development of Trustworthy Component Systems -- Partial Order Reductions Using Compositional Confluence Detection -- A Formal Method for Developing Provably Correct Fault-Tolerant Systems Using Partial Refinement and Composition -- Verification -- Abstract Specification of the UBIFS File System for Flash Memory -- Inferring Mealy Machines -- Formal Management of CAD/CAM Processes -- Concurrency -- Translating Safe Petri Nets to Statecharts in a Structure-Preserving Way -- Symbolic Predictive Analysis for Concurrent Programs -- On the Difficulties of Concurrent-System Design, Illustrated with a 2×2 Switch Case Study -- Refinement -- Sums and Lovers: Case Studies in Security, Compositionality and Refinement -- Iterative Refinement of Reverse-Engineered Models by Model-Based Testing -- Model Checking Linearizability via Refinement -- Static Analysis -- It’s Doomed; We Can Prove It -- “Carbon Credits” for Resource-Bounded Computations Using Amortised Analysis -- Field-Sensitive Value Analysis by Field-Insensitive Analysis -- Theorem Proving -- Making Temporal Logic Calculational: A Tool for Unification and Discovery -- A Tableau for CTL* -- Certifiable Specification and Verification of C Programs -- Formal Reasoning about Expectation Properties for Continuous Random Variables -- Semantics -- The Denotational Semantics of slotted-Circus -- Unifying Probability with Nondeterminism -- Towards an Operational Semantics for Alloy -- A Robust Semantics Hides Fewer Errors -- Special Track: Industrial Applications I -- Analysis of a Clock Synchronization Protocol for Wireless Sensor Networks -- Formal Verification of Avionics Software Products -- Formal Verification of Curved Flight Collision Avoidance Maneuvers: A Case Study -- Object-Orientation -- Connecting UML and VDM++ with Open Tool Support -- Language and Tool Support for Class and State Machine Refinement in UML-B -- Dynamic Classes: Modular Asynchronous Evolution of Distributed Concurrent Objects -- Abstract Object Creation in Dynamic Logic -- Pointers -- Reasoning about Memory Layouts -- A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis -- Real-Time -- On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery -- Verifying Real-Time Systems against Scenario-Based Requirements -- Special Track: Tools and Industrial Applications II -- Formal Specification of a Cardiac Pacing System -- Automated Property Verification for Large Scale B Models -- Reduced Execution Semantics of MPI: From Theory to Practice -- Model Checking II -- A Metric Encoding for Bounded Model Checking -- An Incremental Approach to Scope-Bounded Checking Using a Lightweight Formal Method -- Verifying Information Flow Control over Unbounded Processes -- Specification and Verification of Web Applications in Rewriting Logic -- Industry-Day Abstracts -- Verifying the Microsoft Hyper-V Hypervisor with VCC -- Industrial Practice in Formal Methods: A Review -- Model-Based GUI Testing Using Uppaal at Novo Nordisk. |
Record Nr. | UNISA-996466367603316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theoretical and practical aspects of SPIN model checking : 5th and 6th International SPIN Workshops, Trento, Italy, July 5, 1999, Toulouse, France, September 21 and 24, 1999, proceedings / / edited by Dennis Dams [and three others] |
Edizione | [1st ed. 1999.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
Descrizione fisica | 1 online resource (X, 282 p.) |
Disciplina | 005.276 |
Collana | Lecture notes in computer science |
Soggetto topico |
SPIN (Computer file)
Computer software - Verification |
ISBN | 3-540-48234-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | I:Selection of Papers Presented at 5thSPIN99 -- Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving -- Runtime Efficient State Compaction in Spin -- Distributed-Memory Model Checking with SPIN -- Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness -- Divide, Abstract, and Model-Check -- II: Papers Presented at 6thSPIN99 -- Formal Methods Adoption: What’s Working, What’s Not! -- Model Checking for Managers -- Xspin/Project - Integrated Validation Management for Xspin -- Analyzing Mode Confusion via Model Checking -- Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin -- Java PathFinder A Translator from Java to Promela -- VIP: A Visual Interface for Promela -- Events in Property Patterns -- Assume-Guarantee Model Checking of Software: A Comparative Case Study -- A Framework for Automatic Construction of Abstract Promela Models -- Model Checking Operator Procedures -- Applying Model Checking in Java Verification -- The Engineering of a Model Checker: the Gnu i-Protocol Case Study Revisited. -- Embedding a Dialect of SDL in PROMELA -- dSPIN: A Dynamic Extension of SPIN. |
Record Nr. | UNINA-9910143649503321 |
Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Theoretical and practical aspects of SPIN model checking : 5th and 6th International SPIN Workshops, Trento, Italy, July 5, 1999, Toulouse, France, September 21 and 24, 1999, proceedings / / edited by Dennis Dams [and three others] |
Edizione | [1st ed. 1999.] |
Pubbl/distr/stampa | Berlin, Germany ; ; New York, New York : , : Springer, , [1999] |
Descrizione fisica | 1 online resource (X, 282 p.) |
Disciplina | 005.276 |
Collana | Lecture notes in computer science |
Soggetto topico |
SPIN (Computer file)
Computer software - Verification |
ISBN | 3-540-48234-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | I:Selection of Papers Presented at 5thSPIN99 -- Integrated Formal Verification: Using Model Checking with Automated Abstraction, Invariant Generation, and Theorem Proving -- Runtime Efficient State Compaction in Spin -- Distributed-Memory Model Checking with SPIN -- Partial Order Reduction in Presence of Rendez-vous Communications with Unless Constructs and Weak Fairness -- Divide, Abstract, and Model-Check -- II: Papers Presented at 6thSPIN99 -- Formal Methods Adoption: What’s Working, What’s Not! -- Model Checking for Managers -- Xspin/Project - Integrated Validation Management for Xspin -- Analyzing Mode Confusion via Model Checking -- Detecting Feature Interactions in the Terrestrial Trunked Radio (TETRA) Network Using Promela and Xspin -- Java PathFinder A Translator from Java to Promela -- VIP: A Visual Interface for Promela -- Events in Property Patterns -- Assume-Guarantee Model Checking of Software: A Comparative Case Study -- A Framework for Automatic Construction of Abstract Promela Models -- Model Checking Operator Procedures -- Applying Model Checking in Java Verification -- The Engineering of a Model Checker: the Gnu i-Protocol Case Study Revisited. -- Embedding a Dialect of SDL in PROMELA -- dSPIN: A Dynamic Extension of SPIN. |
Record Nr. | UNISA-996465844203316 |
Berlin, Germany ; ; New York, New York : , : Springer, , [1999] | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|