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 Methodology and Software Technology [[electronic resource] ] : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen
| Algebraic Methodology and Software Technology [[electronic resource] ] : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 508 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algebra Computer logic Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-45719-4 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- From Specifications to Code in Casl -- Automata and Games for Synthesis -- Pragmatics of Modular SOS -- Tool-Assisted Specification and Verification of the JavaCard Platform -- Higher-Order Quantification and Proof Search* -- Algebraic Support for Service-Oriented Architecture -- Regular Papers -- Fully Automatic Adaptation of Software Components Based on Semantic Specifications* -- HasCasl: Towards Integrated Specification and Development of Functional Programs -- Removing Redundant Arguments of Functions* -- A Class of Decidable Parametric Hybrid Systems -- Vacuity Checking in the Modal Mu-Calculus* -- On Solving Temporal Logic Queries -- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations* -- An Algebra of Non-safe Petri Boxes -- Refusal Simulation and Interactive Games -- A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching -- Equational Axioms for Probabilistic Bisimilarity -- Bisimulation by Unification* -- Transforming Processes to Check and Ensure Information Flow Security* -- On Bisimulations for the Spi Calculus* -- Specifying and Verifying a Decimal Representation in Java for Smart Cards* -- A Method for Secure Smartcard Applications -- Extending JML Specifications with Temporal Logic -- Algebraic Dynamic Programming -- Analyzing String Buffers in C -- A Foundation of Escape Analysis* -- A Framework for Order-Sorted Algebra -- Guarded Transitions in Evolving Specifications -- Revisiting the Categorical Approach to Systems* -- Proof Transformations for Evolutionary Formal Software Development -- Sharing Objects by Read-Only References -- Class-Based versus Object-Based: A Denotational Comparison -- System Descriptions -- BRAIN: Backward Reachability Analysis with Integers -- The Development Graph Manager Maya. |
| Record Nr. | UNISA-996466342103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen
| Algebraic Methodology and Software Technology : 9th International Conference, AMAST 2002, Saint-Gilles-les- Bains, Reunion Island, France, September 9-13, 2002. Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
| Edizione | [1st ed. 2002.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 |
| Descrizione fisica | 1 online resource (XII, 508 p.) |
| Disciplina | 005.1 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Software engineering Algebra Computer logic Mathematical logic Theory of Computation Software Engineering/Programming and Operating Systems Logics and Meanings of Programs Mathematical Logic and Formal Languages Software Engineering |
| ISBN | 3-540-45719-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- From Specifications to Code in Casl -- Automata and Games for Synthesis -- Pragmatics of Modular SOS -- Tool-Assisted Specification and Verification of the JavaCard Platform -- Higher-Order Quantification and Proof Search* -- Algebraic Support for Service-Oriented Architecture -- Regular Papers -- Fully Automatic Adaptation of Software Components Based on Semantic Specifications* -- HasCasl: Towards Integrated Specification and Development of Functional Programs -- Removing Redundant Arguments of Functions* -- A Class of Decidable Parametric Hybrid Systems -- Vacuity Checking in the Modal Mu-Calculus* -- On Solving Temporal Logic Queries -- Modelling Concurrent Behaviours by Commutativity and Weak Causality Relations* -- An Algebra of Non-safe Petri Boxes -- Refusal Simulation and Interactive Games -- A Theory of May Testing for Asynchronous Calculi with Locality and No Name Matching -- Equational Axioms for Probabilistic Bisimilarity -- Bisimulation by Unification* -- Transforming Processes to Check and Ensure Information Flow Security* -- On Bisimulations for the Spi Calculus* -- Specifying and Verifying a Decimal Representation in Java for Smart Cards* -- A Method for Secure Smartcard Applications -- Extending JML Specifications with Temporal Logic -- Algebraic Dynamic Programming -- Analyzing String Buffers in C -- A Foundation of Escape Analysis* -- A Framework for Order-Sorted Algebra -- Guarded Transitions in Evolving Specifications -- Revisiting the Categorical Approach to Systems* -- Proof Transformations for Evolutionary Formal Software Development -- Sharing Objects by Read-Only References -- Class-Based versus Object-Based: A Denotational Comparison -- System Descriptions -- BRAIN: Backward Reachability Analysis with Integers -- The Development Graph Manager Maya. |
| Record Nr. | UNINA-9910768450903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2002 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Combining Systems [[electronic resource] ] : 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013, Proceedings / / edited by Pascal Fontaine, Christophe Ringeissen, Renate Schmidt
| Frontiers of Combining Systems [[electronic resource] ] : 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013, Proceedings / / edited by Pascal Fontaine, Christophe Ringeissen, Renate Schmidt |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 359 p. 35 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Algorithms Computer programming Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Algorithm Analysis and Problem Complexity Programming Techniques |
| ISBN | 3-642-40885-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- MetiTarski’s Menagerie of Cooperating Systems -- Inductive Theorem Proving -- Combining Superposition and Induction: A Practical Realization -- Arrays and Memory Access Optimization -- Definability of Accelerated Relations in a Theory of Arrays and Its Applications -- Verification of Composed Array-Based Systems with Applications to Security-Aware Workflows -- Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages -- Approximation and Forgetting -- Roughening the EL Envelope -- Uniform Interpolation of ALC-Ontologies Using Fixpoints -- Abduction in Logic Programming as Second-Order Quantifier Elimination -- Invited Talk 2 -- Witness Runs for Counter Machines -- Temporal and Description Logic Techniques -- Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders -- Temporal Query Answering in the Description Logic DL-Lite -- Verification of Golog Programs over Description Logic Actions -- Invited Talk 3 -- Specification and Verification of Linear Dynamical Systems: Advances and Challenges -- Theorem Proving with Theories and Sorts -- Obtaining Finite Local Theory Axiomatizations via Saturation -- Non-cyclic Sorts for First-Order Satisfiability -- Detection of First Order Axiomatic Theories -- Mechanizing the Metatheory of Sledgehammer -- Invited Talk 4 -- From Resolution and DPLL to Solving Arithmetic Constraints -- Modal Logic and Description Logic -- Tableaux for Relation-Changing Modal Logics -- Computing Minimal Models Modulo Subset-Simulation for Modal Logics -- Hybrid Unification in the Description Logic EL -- Rewriting -- Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering -- On Forward Closure and the Finite Variant Property -- Term Rewriting with Logical Constraints. |
| Record Nr. | UNISA-996465430503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Combining Systems : 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013, Proceedings / / edited by Pascal Fontaine, Christophe Ringeissen, Renate Schmidt
| Frontiers of Combining Systems : 9th International Symposium, FroCoS 2013, Nancy, France, September 18-20, 2013, Proceedings / / edited by Pascal Fontaine, Christophe Ringeissen, Renate Schmidt |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XII, 359 p. 35 illus.) |
| Disciplina | 006.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Mathematical logic Computer logic Software engineering Algorithms Computer programming Artificial Intelligence Mathematical Logic and Formal Languages Logics and Meanings of Programs Software Engineering Algorithm Analysis and Problem Complexity Programming Techniques |
| ISBN | 3-642-40885-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk 1 -- MetiTarski’s Menagerie of Cooperating Systems -- Inductive Theorem Proving -- Combining Superposition and Induction: A Practical Realization -- Arrays and Memory Access Optimization -- Definability of Accelerated Relations in a Theory of Arrays and Its Applications -- Verification of Composed Array-Based Systems with Applications to Security-Aware Workflows -- Presburger Arithmetic in Memory Access Optimization for Data-Parallel Languages -- Approximation and Forgetting -- Roughening the EL Envelope -- Uniform Interpolation of ALC-Ontologies Using Fixpoints -- Abduction in Logic Programming as Second-Order Quantifier Elimination -- Invited Talk 2 -- Witness Runs for Counter Machines -- Temporal and Description Logic Techniques -- Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders -- Temporal Query Answering in the Description Logic DL-Lite -- Verification of Golog Programs over Description Logic Actions -- Invited Talk 3 -- Specification and Verification of Linear Dynamical Systems: Advances and Challenges -- Theorem Proving with Theories and Sorts -- Obtaining Finite Local Theory Axiomatizations via Saturation -- Non-cyclic Sorts for First-Order Satisfiability -- Detection of First Order Axiomatic Theories -- Mechanizing the Metatheory of Sledgehammer -- Invited Talk 4 -- From Resolution and DPLL to Solving Arithmetic Constraints -- Modal Logic and Description Logic -- Tableaux for Relation-Changing Modal Logics -- Computing Minimal Models Modulo Subset-Simulation for Modal Logics -- Hybrid Unification in the Description Logic EL -- Rewriting -- Disproving Confluence of Term Rewriting Systems by Interpretation and Ordering -- On Forward Closure and the Finite Variant Property -- Term Rewriting with Logical Constraints. |
| Record Nr. | UNINA-9910485011003321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Frontiers of Combining Systems [[electronic resource] ] : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen
| Frontiers of Combining Systems [[electronic resource] ] : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 298 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Mathematical Logic and Foundations Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-46421-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Combining Logic and Optimization in Cutting Plane Theory -- Session 1 -- Towards Cooperative Interval Narrowing -- Integrating Constraint Solving into Proof Planning -- Termination of Constraint Contextual Rewriting -- Invited Paper -- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination -- Session 2 -- Normal Forms and Proofs in Combined Modal and Temporal Logics -- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic -- Session 3 -- Handling Differential Equations with Constraints for Decision Support -- Non-trivial Symbolic Computations in Proof Planning -- Integrating Computer Algebra and Reasoning through the Type System of Aldor -- Invited Paper -- Combinations of Model Checking and Theorem Proving -- Session 4 -- Compiling Multi-paradigm Declarative Programs into Prolog -- Modular Redundancy for Theorem Proving -- Composing and Controlling Search in Reasoning Theories Using Mappings -- Invited Paper -- Why Combined Decision Problems Are Often Intractable -- Session 5 -- Congruence Closure Modulo Associativity and Commutativity -- Combining Equational Theories Sharing Non-Collapse-Free Constructors -- Comparing Expressiveness of Set Constructor Symbols. |
| Record Nr. | UNISA-996466124503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Frontiers of Combining Systems : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen
| Frontiers of Combining Systems : Third International Workshop, FroCoS 2000 Nancy, France, March 22-24, 2000 Proceedings / / edited by Helene Kirchner, Christophe Ringeissen |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (X, 298 p.) |
| Disciplina | 511.3 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Mathematical logic
Artificial intelligence Mathematical Logic and Foundations Artificial Intelligence Mathematical Logic and Formal Languages |
| ISBN | 3-540-46421-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Paper -- Combining Logic and Optimization in Cutting Plane Theory -- Session 1 -- Towards Cooperative Interval Narrowing -- Integrating Constraint Solving into Proof Planning -- Termination of Constraint Contextual Rewriting -- Invited Paper -- Axioms vs. Rewrite Rules: From Completeness to Cut Elimination -- Session 2 -- Normal Forms and Proofs in Combined Modal and Temporal Logics -- Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic -- Session 3 -- Handling Differential Equations with Constraints for Decision Support -- Non-trivial Symbolic Computations in Proof Planning -- Integrating Computer Algebra and Reasoning through the Type System of Aldor -- Invited Paper -- Combinations of Model Checking and Theorem Proving -- Session 4 -- Compiling Multi-paradigm Declarative Programs into Prolog -- Modular Redundancy for Theorem Proving -- Composing and Controlling Search in Reasoning Theories Using Mappings -- Invited Paper -- Why Combined Decision Problems Are Often Intractable -- Session 5 -- Congruence Closure Modulo Associativity and Commutativity -- Combining Equational Theories Sharing Non-Collapse-Free Constructors -- Comparing Expressiveness of Set Constructor Symbols. |
| Record Nr. | UNINA-9910144132403321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||