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.
Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung
| Automata, Languages and Programming [[electronic resource] ] : 32nd International Colloquim, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings / / edited by Luis Caires, Guiseppe F. Italiano, Luis Monteiro, Catuscia Palamidessi, Moti Yung |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (L, 1482 p.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Mathematical logic Software engineering Data structures (Computer science) Information theory Artificial intelligence—Data processing Computer Science Mathematical Logic and Foundations Theory of Computation Software Engineering Data Structures and Information Theory Data Science |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Lectures -- Data Structures I -- Cryptography and Complexity -- Data Structures II -- Cryptography and Distributed Systems -- Graph Algorithms I -- Security Mechanisms -- Graph Algorithms II -- Automata and Formal Languages I -- Signature and Message Authentication -- Algorithmic Game Theory -- Automata and Logic -- Computational Algebra -- Cache-Oblivious Algorithms and Algorithmic Engineering -- On-line Algorithms -- Security Protocols Logic -- Random Graphs -- Concurrency I -- Encryption and related Primitives -- Approximation Algorithms I -- Games -- Approximation Algorithms II -- Lower Bounds -- Probability -- Approximation Algorithms III -- Automata and Formal Languages II -- Approximation Algorithms IV -- Algebraic Computation and Communication Complexity -- Concurrency II -- String Matching and Computational Biology -- Quantum Complexity -- Analysis and Verification -- Geometry and Load Balancing -- Concrete Complexity and Codes -- Model Theory and Model Checking. |
| Record Nr. | UNISA-996465830303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
| Computational Logic — CL 2000 [[electronic resource] ] : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XXXVIII, 1382 p. 33 illus.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer systems Machine theory Computer science Computer programming Artificial Intelligence Software Engineering Computer System Implementation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques |
| ISBN | 3-540-44957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic. |
| Record Nr. | UNISA-996465565903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Computational Logic — CL 2000 : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey
| Computational Logic — CL 2000 : First International Conference London, UK, July 24–28, 2000 Proceedings / / edited by John Lloyd, Veronica Dahl, Ulrich Furbach, Manfred Kerber, Kung-Kiu Lau, Catuscia Palamidessi, Luis M. Pereira, Yehoshua Sagiv, Peter J. Stuckey |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XXXVIII, 1382 p. 33 illus.) |
| Disciplina | 004/.01/5113 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Software engineering Computer systems Machine theory Computer science Computer programming Artificial Intelligence Software Engineering Computer System Implementation Formal Languages and Automata Theory Computer Science Logic and Foundations of Programming Programming Techniques |
| ISBN | 3-540-44957-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Computational Logic: Memories of the Past and Challenges for the Future -- ILP: Just Do It -- Databases and Higher Types -- A Denotational Semantics for First-Order Logic -- Logic, Knowledge Representation, and Bayesian Decision Theory -- Program Development (LOPSTR) -- Logic Program Synthesis in a Higher-Order Setting -- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction -- Binary Speed Up for Logic Programs -- A New Module System for Prolog -- Logic Programming: Theory and Extensions -- Partial Models of Extended Generalized Logic Programs -- Alternating Fixpoint Theory for Logic Programs with Priority -- Proving Failure in Functional Logic Programs -- Semantics of Input-Consuming Logic Programs -- A Denotational Semantics of Defeasible Logic -- Isoinitial Semantics for Logic Programs -- Abstract Syntax for Variable Binders: An Overview -- Goal-Directed Proof Search in Multiple-Conclusioned Intuitionistic Logic -- Efficient EM Learning with Tabulation for Parameterized Logic Programs -- Model Generation Theorem Proving with Finite Interval Constraints -- Combining Mobile Processes and Declarative Programming -- Constraints -- Representing Trees with Constraints -- Dominance Constraints with Set Operators -- Better Communication for Tighter Cooperation -- Arc Consistency Algorithms via Iterations of Subsumed Functions -- AVAL: An Enumerative Method for SAT -- Constraint Logic Programming for Local and Symbolic Model-Checking -- A CLP Framework for Computing Structural Test Data -- Modelling Digital Circuits Problems with Set Constraints -- Promoting Constraints to First-Class Status -- Developing Finite Domain Constraints — A Data Model Approach -- Concurrent Constraint Programming with Process Mobility -- A System for Tabled Constraint Logic Programming -- Automated Deduction: Putting Theory into Practice -- Finding Tractable Formulas in NNF -- The Taming of the (X)OR -- On an ?-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL -- Representing Object Code -- Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking -- Certification of Compiler Optimizations Using Kleene Algebra with Tests -- An Application of Model Building in a Resolution Decision Procedure for Guarded Formulas -- Model Checking for Timed Logic Processes -- Perfect Model Checking via Unfold/Fold Transformations -- Automatic Derivation and Application of Induction Schemes for Mutually Recursive Functions -- Proof Planning with Multiple Strategies -- The Theory of Total Unary RPO Is Decidable -- Knowledge Representation and Non-monotonic Reasoning -- On the Problem of Computing the Well-Founded Semantics -- Computing Equilibrium Models Using Signed Formulas -- Extending Classical Logic with Inductive Definitions -- A Simple Characterization of Extended Abduction -- A New Equational Foundation for the Fluent Calculus -- Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams -- Decidability Results for the Propositional Fluent Calculus -- A Meta-logical Semantics for Features and Fluents Based on Compositional Operators over Normal Logic Programs -- Default Reasoning with Specificity -- Planning under Incomplete Knowledge -- Wire Routing and Satisfiability Planning -- Including Diagnostic Information in Configuration Models -- Comparing the Expressive Powers of Some Syntactically Restricted Classes of Logic Programs -- On Complexity of Updates through Integrity Constraints -- Computational Complexity of Planning Based on Partial Information about the System’s Present and Past States -- Smallest Equivalent Sets for Finite Propositional Formula Circumscription -- A Semantics for Persistency in Propositional Dynamic Logic -- Database Systems (DOOD) -- Applications of Annotated Predicate Calculus to Querying Inconsistent Databases -- Querying Inconsistent Databases: Algorithms and Implementation -- On Verification in Logic Database Languages -- Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets -- Linearly Bounded Reformulations of Conjunctive Databases -- MuTACLP: A Language for Declarative GIS Analysis -- Reasoning about Duplicate Elimination with Description Logic -- A File System Based on Concept Analysis -- A Semantic Approach for Schema Evolution and Versioning in Object-Oriented Databases -- SLDMagic — The Real Magic (With Applications to Web Queries) -- FLORA: Implementing an Efficient DOOD System Using a Tabling Logic Engine -- Design and Implementation of the Physical Layer in WebBases: The XRover Experience -- A Dynamic Approach to Termination Analysis for Active Database Rules -- Constraint-Based Termination Analysis for Cyclic Active Database Rules -- A Formal Model for an Expressive Fragment of XSLT -- On the Equivalence of XML Patterns -- Querying XML Specified WWW Sites: Links and Recursion in XML-GL -- A Heuristic Approach for Converting HTML Documents to XML Documents -- Specification of an Active Database System Application Using Dynamic Relation Nets -- Invariance, Maintenance, and Other Declarative Objectives of Triggers — A Formal Characterization of Active Databases -- Logic Programming: Implementations and Applications -- Fluents: A Refactoring of Prolog for Uniform Reflection and Interoperation with External Objects -- So Many WAM Variations, So Little Time -- A Module Based Analysis for Memory Reuse in Mercury -- Mode Checking in HAL -- The Impact of Cache Coherence Protocols on Parallel Logic Programming Systems -- Data Protection by Logic Programming -- A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language -- A Logic Programming Application for the Analysis of Spanish Verse -- A Documentation Generator for (C)LP Systems -- Psychiatric Diagnosis from the Viewpoint of Computational Logic. |
| Record Nr. | UNINA-9910143626303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
CONCUR 2000 - Concurrency Theory [[electronic resource] ] : 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings / / edited by Catuscia Palamidessi
| CONCUR 2000 - Concurrency Theory [[electronic resource] ] : 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings / / edited by Catuscia Palamidessi |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 613 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Programming languages (Electronic computers) Computer logic Computers Computer programming Computer communication systems Computer System Implementation Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Computation by Abstract Devices Programming Techniques Computer Communication Networks |
| ISBN | 3-540-44618-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Combining Theorem Proving and Model Checking through Symbolic Analysis -- Verification Is Experimentation! -- Compositional Performance Analysis Using Probabilistic I/O Automata -- Formal Models for Communication-Based Design -- Invited Tutorials -- Programming Access Control: The Klaim Experience -- Exploiting Hierarchical Structure for Efficient Formal Verification -- From Process Calculi to Process Frameworks -- Verification Using Tabled Logic Programming -- Accepted Papers -- Open Systems in Reactive Environments: Control and Synthesis -- Model Checking with Finite Complete Prefixes Is PSPACE-Complete -- Verifying Quantitative Properties of Continuous Probabilistic Timed Automata -- The Impressive Power of Stopwatches -- Optimizing Büchi Automata -- Generalized Model Checking: Reasoning about Partial State Spaces -- Reachability Analysis for Some Models of Infinite-State Transition Systems -- Process Spaces -- Failure Semantics for the Exchange of Information in Multi-Agent Systems -- Proof-Outlines for Threads in Java -- Deriving Bisimulation Congruences for Reactive Systems -- Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic -- Process Languages for Rooted Eager Bisimulation -- Action Contraction -- A Theory of Testing for Markovian Processes -- Reasoning about Probabilistic Lossy Channel Systems -- Weak Bisimulation for Probabilistic Systems -- Nondeterminism and Probabilistic Choice: Obeying the Laws -- Secrecy and Group Creation -- On the Reachability Problem in Cryptographic Protocols -- Secure Information Flow for Concurrent Processes -- LP Deadlock Checking Using Partial Order Dependencies -- Pomsets for Local Trace Languages -- Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs -- The Control of Synchronous Systems -- Typing Non-uniform Concurrent Objects -- An Implicitly-Typed Deadlock-Free Process Calculus -- Typed Mobile Objects -- Synthesizing Distributed Finite-State Systems from MSCs -- Emptiness Is Decidable for Asynchronous Cellular Machines -- Revisiting Safety and Liveness in the Context of Failures -- Well-Abstracted Transition Systems -- A Unifying Approach to Data-Independence -- Chi Calculus with Mismatch. |
| Record Nr. | UNISA-996465435403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
CONCUR 2000 - Concurrency Theory : 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings / / edited by Catuscia Palamidessi
| CONCUR 2000 - Concurrency Theory : 11th International Conference, University Park, PA, USA, August 22-25, 2000 Proceedings / / edited by Catuscia Palamidessi |
| Edizione | [1st ed. 2000.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
| Descrizione fisica | 1 online resource (XI, 613 p.) |
| Disciplina | 003.3 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Architecture, Computer
Programming languages (Electronic computers) Computer logic Computers Computer programming Computer communication systems Computer System Implementation Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Computation by Abstract Devices Programming Techniques Computer Communication Networks |
| ISBN | 3-540-44618-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Combining Theorem Proving and Model Checking through Symbolic Analysis -- Verification Is Experimentation! -- Compositional Performance Analysis Using Probabilistic I/O Automata -- Formal Models for Communication-Based Design -- Invited Tutorials -- Programming Access Control: The Klaim Experience -- Exploiting Hierarchical Structure for Efficient Formal Verification -- From Process Calculi to Process Frameworks -- Verification Using Tabled Logic Programming -- Accepted Papers -- Open Systems in Reactive Environments: Control and Synthesis -- Model Checking with Finite Complete Prefixes Is PSPACE-Complete -- Verifying Quantitative Properties of Continuous Probabilistic Timed Automata -- The Impressive Power of Stopwatches -- Optimizing Büchi Automata -- Generalized Model Checking: Reasoning about Partial State Spaces -- Reachability Analysis for Some Models of Infinite-State Transition Systems -- Process Spaces -- Failure Semantics for the Exchange of Information in Multi-Agent Systems -- Proof-Outlines for Threads in Java -- Deriving Bisimulation Congruences for Reactive Systems -- Bisimilarity Congruences for Open Terms and Term Graphs via Tile Logic -- Process Languages for Rooted Eager Bisimulation -- Action Contraction -- A Theory of Testing for Markovian Processes -- Reasoning about Probabilistic Lossy Channel Systems -- Weak Bisimulation for Probabilistic Systems -- Nondeterminism and Probabilistic Choice: Obeying the Laws -- Secrecy and Group Creation -- On the Reachability Problem in Cryptographic Protocols -- Secure Information Flow for Concurrent Processes -- LP Deadlock Checking Using Partial Order Dependencies -- Pomsets for Local Trace Languages -- Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs -- The Control of Synchronous Systems -- Typing Non-uniform Concurrent Objects -- An Implicitly-Typed Deadlock-Free Process Calculus -- Typed Mobile Objects -- Synthesizing Distributed Finite-State Systems from MSCs -- Emptiness Is Decidable for Asynchronous Cellular Machines -- Revisiting Safety and Liveness in the Context of Failures -- Well-Abstracted Transition Systems -- A Unifying Approach to Data-Independence -- Chi Calculus with Mismatch. |
| Record Nr. | UNINA-9910143623903321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Formal Techniques for Distributed Objects, Components, and Systems [[electronic resource] ] : 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings / / edited by Erika Ábrahám, Catuscia Palamidessi
| Formal Techniques for Distributed Objects, Components, and Systems [[electronic resource] ] : 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings / / edited by Erika Ábrahám, Catuscia Palamidessi |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 301 p. 75 illus.) |
| Disciplina | 005.1015113 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Computer logic
Software engineering Computers Mathematical logic Logics and Meanings of Programs Software Engineering Computation by Abstract Devices Mathematical Logic and Formal Languages |
| ISBN | 3-662-43613-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Specification Languages and Type Systems -- Monitoring and Testing -- Security Analysis -- Bisimulation, Abstraction and Reduction. |
| Record Nr. | UNISA-996217774403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Formal Techniques for Distributed Objects, Components, and Systems : 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings / / edited by Erika Ábrahám, Catuscia Palamidessi
| Formal Techniques for Distributed Objects, Components, and Systems : 34th IFIP WG 6.1 International Conference, FORTE 2014, Held as Part of the 9th International Federated Conference on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings / / edited by Erika Ábrahám, Catuscia Palamidessi |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XII, 301 p. 75 illus.) |
| Disciplina | 005.1015113 |
| Collana | Programming and Software Engineering |
| Soggetto topico |
Computer science
Software engineering Machine theory Computer Science Logic and Foundations of Programming Software Engineering Theory of Computation Formal Languages and Automata Theory |
| ISBN | 3-662-43613-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Specification Languages and Type Systems -- Monitoring and Testing -- Security Analysis -- Bisimulation, Abstraction and Reduction. |
| Record Nr. | UNINA-9910484117303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Horizons of the Mind. A Tribute to Prakash Panangaden [[electronic resource] ] : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten
| Horizons of the Mind. A Tribute to Prakash Panangaden [[electronic resource] ] : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 499 p. 36 illus.) : online resource |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Probability and Statistics in Computer Science Theory of Computation |
| ISBN | 3-319-06880-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Layout Randomization and Nondeterminism -- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations -- An Operational Interpretation of Negative Probabilities and No-Signalling Models -- Bisimulation on Markov Processes over Arbitrary Measurable Spaces -- Probabilistic Model Checking for Energy-Utility Analysis -- (Co)Algebraic Characterizations of Signal Flow Graphs -- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra -- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs -- Privacy from Accelerating Eavesdroppers: The Impact of Losses -- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata -- From Haar to Lebesgue via Domain Theory -- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars -- The Logic of Entanglement -- Free Energy of Petri Nets -- Laudatio for Prakash Panangaden -- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms -- Bisimulation for Markov Decision Processes through Families of Functional Expressions -- Random Measurable Selections -- A Final Coalgebra for k-regular Sequences -- Automata Learning: A Categorical Perspective -- Optimal Coin Flipping -- Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation -- Euclidean Representations of Quantum States -- TCC, with History -- Probabilistic and Quantum Event Structures. |
| Record Nr. | UNISA-996203720603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Horizons of the Mind. A Tribute to Prakash Panangaden : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten
| Horizons of the Mind. A Tribute to Prakash Panangaden : Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday / / edited by Franck van Breugel, Elham Kashefi, Catuscia Palamidessi, Jan Rutten |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XVIII, 499 p. 36 illus.) : online resource |
| Disciplina | 005.1015113 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Machine theory Computer science—Mathematics Mathematical statistics Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory Probability and Statistics in Computer Science Theory of Computation |
| ISBN | 3-319-06880-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Layout Randomization and Nondeterminism -- Probabilistic Model Checking of Labelled Markov Processes via Finite Approximate Bisimulations -- An Operational Interpretation of Negative Probabilities and No-Signalling Models -- Bisimulation on Markov Processes over Arbitrary Measurable Spaces -- Probabilistic Model Checking for Energy-Utility Analysis -- (Co)Algebraic Characterizations of Signal Flow Graphs -- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra -- Leaving Traces: A Note on a Sound and Complete Trace Logic for Concurrent Constraint Programs -- Privacy from Accelerating Eavesdroppers: The Impact of Losses -- The Complexity of Computing a Bisimilarity Pseudometric on Probabilistic Automata -- From Haar to Lebesgue via Domain Theory -- Word Order Alternation in Sanskrit via Precyclicity in Pregroup Grammars -- The Logic of Entanglement -- Free Energy of Petri Nets -- Laudatio for Prakash Panangaden -- Generalized Differential Privacy: Regions of Priors That Admit Robust Optimal Mechanisms -- Bisimulation for Markov Decision Processes through Families of Functional Expressions -- Random Measurable Selections -- A Final Coalgebra for k-regular Sequences -- Automata Learning: A Categorical Perspective -- Optimal Coin Flipping -- Entanglement, Flow and Classical Simulatability in Measurement Based Quantum Computation -- Euclidean Representations of Quantum States -- TCC, with History -- Probabilistic and Quantum Event Structures. |
| Record Nr. | UNINA-9910484141703321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Logic Programming [[electronic resource] ] : 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, Proceedings / / edited by Catuscia Palamidessi
| Logic Programming [[electronic resource] ] : 19th International Conference, ICLP 2003, Mumbai, India, December 9-13, 2003, Proceedings / / edited by Catuscia Palamidessi |
| Edizione | [1st ed. 2003.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
| Descrizione fisica | 1 online resource (XII, 524 p.) |
| Disciplina | 005.115 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Computer programming Programming languages (Electronic computers) Computer logic Mathematical logic Artificial intelligence Software Engineering/Programming and Operating Systems Programming Techniques Programming Languages, Compilers, Interpreters Logics and Meanings of Programs Mathematical Logic and Formal Languages Artificial Intelligence |
| ISBN |
1-280-30656-4
9786610306565 3-540-24599-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Achieving Type Safety for Low-Level Code -- Logic Information Systems for Logic Programmers -- A Logic Programming View of Authorization in Distributed Systems -- Compositional Verification of Infinite State Systems -- A Constraint-Based Approach to Structure Prediction for Simplified Protein Models That Outperforms Other Existing Methods -- Invited Tutorials -- Concurrency, Time, and Constraints -- Symbolic Model-Checking for Biochemical Systems -- Component-Based Software Development and Logic Programming -- A Tutorial on Proof Theoretic Foundations of Logic Programming -- Regular Papers -- Objective: In Minimum Context -- Handling Existential Derived Predicates in View Updating -- Efficient Evaluation of Logic Programs for Querying Data Integration Systems -- Argumentation Databases -- Order and Negation as Failure -- Computing Minimal Models, Stable Models, and Answer Sets -- Uniform Equivalence of Logic Programs under the Stable Model Semantics -- Answer Set Programming Phase Transition: A Study on Randomly Generated Programs -- Termination Analysis with Types Is More Accurate -- A Propagation Tracer for GNU-Prolog: From Formal Definition to Efficient Implementation -- Intensional Sets in CLP -- Implementing Constraint Propagation by Composition of Reductions -- Forward versus Backward Verification of Logic Programs -- Native Preemptive Threads in SWI-Prolog -- Flow Java: Declarative Concurrency for Java -- On the Complexity of Dependent And-Parallelism in Logic Programming -- Higher-Order Substitution Tree Indexing -- Incremental Evaluation of Tabled Logic Programs -- On Deterministic Computations in the Extended Andorra Model -- Timed Concurrent Constraint Programming: Decidability Results and Their Application to LTL -- Is There an Optimal Generic Semantics for First-Order Equations? -- Loop Formulas for Disjunctive Logic Programs -- Default Knowledge in Logic Programs with Uncertainty -- Posters -- A Generic Persistence Model for (C)LP Systems -- Definitions in Answer Set Programming -- A New Mode Declaration for Tabled Predicates -- Adding the Temporal Relations in Semantic Web Ontologies -- Polynomial-Time Learnability from Entailment -- Integration of Semantic Networks for Corpus-Based Word Sense Disambiguation -- Development and Application of Logical Actors Mathematical Apparatus for Logic Programming of Web Agents -- A Real Implementation for Constructive Negation -- Simulating Security Systems Based on Logigrams -- Online Justification for Tabled Logic Programs -- Inducing Musical Rules with ILP -- A Distinct-Head Folding Rule -- Termination Analysis of Logic Programs -- Refactoring Logic Programs -- Termination of Logic Programs for Various Dynamic Selection Rules -- Adding Preferences to Answer Set Planning -- Controlling Semi-automatic Systems with FLUX -- The Language Model LMNtal. |
| Record Nr. | UNISA-996465918003316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
