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.
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell |
| Autore | Kobayashi Naoki |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (283 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | WorrellJames |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57231-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Types and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. |
| Record Nr. | UNISA-996594169203316 |
Kobayashi Naoki
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part II / / edited by Naoki Kobayashi, James Worrell |
| Autore | Kobayashi Naoki |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (283 pages) |
| Disciplina | 40,151 |
| Altri autori (Persone) | WorrellJames |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57231-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Types and Programming Languages -- From Rewrite Rules to Axioms in the lambdaPi-Calculus Modulo Theory -- Light Genericity -- Logical Predicates in Higher-Order Mathematical Operational Semantics -- On Basic Feasible Functionals and the Interpretation Method -- Logic and Proofs -- Succinctness of Cosafety Fragments of LTL via Combinatorial Proof Systems -- A Resolution-Based Interactive Proof System for UNSAT -- Craig Interpolation for Decidable First-Order Fragments -- Clones, closed categories, and combinatory logic -- Infinite-State Systems -- Reachability in Fixed VASS: Expressiveness and Lower Bounds -- From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting -- Dimension-Minimality and Primality of Counter Nets -- Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability. |
| Record Nr. | UNINA-9910847392703321 |
|
Kobayashi Naoki
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (290 pages) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57228-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Ackermannian Completion of Separators -- Infinite Games -- Fair Omega-regular Games -- Stochastic Window Mean-Payoff Games -- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis -- Parity Games on Temporal Graphs -- Categorical Semantics -- Drawing from an Urn is Isometric -- Enriching Diagrams with Algebraic Operations -- Monoidal Extended Stone Duality -- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) -- Automata and Synthesis -- Determinization of Integral Discounted-Sum Automata is Decidable -- Checking History-Determinism is NP-hard for Parity Automata -- Tighter Construction of Tight Büchi Automata -- Synthesis with Privacy Against an Observer. |
| Record Nr. | UNISA-996594169803316 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell
| Foundations of Software Science and Computation Structures : 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, April 6–11, 2024, Proceedings, Part I / / edited by Naoki Kobayashi, James Worrell |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (290 pages) |
| Disciplina | 40,151 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computer science
Mathematical logic Data structures (Computer science) Information theory Computer systems Computer science - Mathematics Theory of Computation Mathematical Logic and Foundations Data Structures and Information Theory Computer System Implementation Mathematics of Computing |
| ISBN | 3-031-57228-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talk -- Ackermannian Completion of Separators -- Infinite Games -- Fair Omega-regular Games -- Stochastic Window Mean-Payoff Games -- Symbolic Solution of Emerson-Lei Games for Reactive Synthesis -- Parity Games on Temporal Graphs -- Categorical Semantics -- Drawing from an Urn is Isometric -- Enriching Diagrams with Algebraic Operations -- Monoidal Extended Stone Duality -- Towards a Compositional Framework for Convex Analysis (with Applications to Probability Theory) -- Automata and Synthesis -- Determinization of Integral Discounted-Sum Automata is Decidable -- Checking History-Determinism is NP-hard for Parity Automata -- Tighter Construction of Tight Büchi Automata -- Synthesis with Privacy Against an Observer. |
| Record Nr. | UNINA-9910847596403321 |
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Reachability Problems [[electronic resource] ] : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / / edited by Joel Ouaknine, Igor Potapov, James Worrell
| Reachability Problems [[electronic resource] ] : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / / edited by Joel Ouaknine, Igor Potapov, James Worrell |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XX, 246 p. 59 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Machine theory Coding theory Information theory Theory of Computation Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Formal Languages and Automata Theory Coding and Information Theory |
| ISBN | 3-319-11439-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets. |
| Record Nr. | UNISA-996199683403316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Reachability Problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / / edited by Joel Ouaknine, Igor Potapov, James Worrell
| Reachability Problems : 8th International Workshop, RP 2014, Oxford, UK, September 22-24, 2014, Proceedings / / edited by Joel Ouaknine, Igor Potapov, James Worrell |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XX, 246 p. 59 illus.) |
| Disciplina | 004 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Machine theory Coding theory Information theory Theory of Computation Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Formal Languages and Automata Theory Coding and Information Theory |
| ISBN | 3-319-11439-5 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Complexity Bounds for Ordinal-Based Termination -- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems -- Reachability and Mortality Problems for Restricted Hierarchical Piecewise Constant Derivatives -- Parameterized Verification of Communicating Automata under Context Bounds -- Regular Strategies in Pushdown Reachability Games -- Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations -- Equivalence Between Model-Checking Flat Counter Systems and Presburger Arithmetic -- Synthesising Succinct Strategies in Safety and Reachability Games -- Integer Vector Addition Systems with States -- Reachability in MDPs: Refining Convergence of Value Iteration -- On the Expressiveness of Metric Temporal Logic over Bounded Timed Words -- Trace Inclusion for One-Counter Nets Revisited -- Mean-Payoff Games with Partial-Observation -- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions -- On Functions Weakly Computable by Petri Nets and Vector Addition Systems -- Generalized Craig Interpolation for Stochastic Satisfiability Modulo Theory Problems -- Transformations for Compositional Verification of Assumption-Commitment Properties -- Compositional Reachability in Petri Nets. |
| Record Nr. | UNINA-9910484772803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||