Computer Science - Theory and Applications [[electronic resource] ] : Fourth International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russia, August 18-23, 2009, Proceedings / / edited by Anna Frid, Andrei S. Morozov, Andrey Rybalchenko, Klaus W. Wagner |
Edizione | [1st ed. 2009.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
Descrizione fisica | 1 online resource (XIII, 369 p.) |
Disciplina | 004.0151 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Algorithms Machine theory Computer science—Mathematics Coding theory Information theory Theory of Computation Formal Languages and Automata Theory Mathematics of Computing Computer Science Logic and Foundations of Programming Coding and Information Theory |
ISBN |
1-280-38317-8
9786613561091 3-642-03351-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Well-Founded and Partial Stable Semantics Logical Aspects -- The Reachability Problem over Infinite Graphs -- Kolmogorov Complexity and Model Selection -- Automatic Verification of Heap-Manipulating Programs Using Separation Logic -- Accepted Papers -- Canonical Calculi: Invertibility, Axiom Expansion and (Non)-determinism -- Integrality Property in Preemptive Parallel Machine Scheduling -- Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes -- k-SAT Is No Harder Than Decision-Unique-k-SAT -- Unique Decipherability in the Monoid of Languages: An Application of Rational Relations -- Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model -- Approximability Distance in the Space of H-Colourability Problems -- On Random Ordering Constraints -- Depth Reduction for Circuits with a Single Layer of Modular Counting Gates -- A Feebly Secure Trapdoor Function -- Partitioning Graphs into Connected Parts -- Structural Complexity of AvgBPP -- Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials -- Simulation of Arithmetical Circuits by Branching Programs with Preservation of Constant Width and Syntactic Multilinearity -- One-Nonterminal Conjunctive Grammars over a Unary Alphabet -- Concatenation of Regular Languages and Descriptional Complexity -- Approximability of the Maximum Solution Problem for Certain Families of Algebras -- Complete Complexity Classification of Short Shop Scheduling -- Compressed Word Problems in HNN-Extensions and Amalgamated Products -- Variations on Muchnik’s Conditional Complexity Theorem -- An Optimal Bloom Filter Replacement Based on Matrix Solving -- Aperiodicity Measure for Infinite Sequences -- On the Complexity of Matroid Isomorphism Problems -- Breaking Anonymity by Learning a Unique Minimum Hitting Set -- The Budgeted Unique Coverage Problem and Color-Coding -- Formal Verification of Gate-Level Computer Systems -- On Models of a Nondeterministic Computation -- New Plain-Exponential Time Classes for Graph Homomorphism -- Languages Recognized with Unbounded Error by Quantum Finite Automata. |
Record Nr. | UNISA-996465528903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Verification, Model Checking, and Abstract Interpretation [[electronic resource] ] : 13th International Conference, VMCAI 2012, Philadelphia, PA, USA, January 22-24, 2012, Proceedings / / edited by Viktor Kuncak, Andrey Rybalchenko |
Edizione | [1st ed. 2012.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
Descrizione fisica | 1 online resource (X, 457 p. 111 illus.) |
Disciplina | 005.1015113 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Software engineering Compilers (Computer programs) Algorithms Machine theory Computer programming Computer Science Logic and Foundations of Programming Software Engineering Compilers and Interpreters Formal Languages and Automata Theory Programming Techniques |
ISBN | 3-642-27940-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465877403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Verified Software: Theorie, Tools, Experiments [[electronic resource] ] : 5th International Conference, VSTTE 2013, Menlo Park, CA, USA, May 17-19, 2013, Revised Selected Papers / / edited by Ernie Cohen, Andrey Rybalchenko |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVI, 345 p. 83 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Artificial intelligence Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-642-54108-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Classifying and Solving Horn Clauses for Verification -- Static Analysis of Programs with Imprecise Probabilistic Inputs -- Effect Analysis for Programs with Callbacks -- Compositional Network Mobility -- Parallel Bounded Verification of Alloy Models by TranScoping -- Extending the Theory of Arrays: memset, memcpy, and Beyond -- An Improved Unrolling-Based Decision Procedure for Algebraic Data Types -- Program Checking with Less Hassle -- Verified Calculations. -- Preserving User Proofs across Specification Changes -- An Automatic Encoding from VeriFast Predicates into Implicit Dynamic Frames -- Automated Code Proofs on a Formal Model of the X86 -- Verification of a Virtual Filesystem Switch -- Verifying Chinese Train Control System under a Combined Scenario by Theorem Proving -- Formal Verification of Loop Bound Estimation for WCET Analysis -- Result Certification of Static Program Analysers with Automated Theorem Provers -- A Formally Verified Generic Branching Algorithm for Global Optimization. |
Record Nr. | UNISA-996205181203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Verified Software: Theorie, Tools, Experiments : 5th International Conference, VSTTE 2013, Menlo Park, CA, USA, May 17-19, 2013, Revised Selected Papers / / edited by Ernie Cohen, Andrey Rybalchenko |
Edizione | [1st ed. 2014.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 |
Descrizione fisica | 1 online resource (XVI, 345 p. 83 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Computer logic Programming languages (Electronic computers) Computer programming Mathematical logic Artificial intelligence Software Engineering Logics and Meanings of Programs Programming Languages, Compilers, Interpreters Programming Techniques Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-642-54108-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Classifying and Solving Horn Clauses for Verification -- Static Analysis of Programs with Imprecise Probabilistic Inputs -- Effect Analysis for Programs with Callbacks -- Compositional Network Mobility -- Parallel Bounded Verification of Alloy Models by TranScoping -- Extending the Theory of Arrays: memset, memcpy, and Beyond -- An Improved Unrolling-Based Decision Procedure for Algebraic Data Types -- Program Checking with Less Hassle -- Verified Calculations. -- Preserving User Proofs across Specification Changes -- An Automatic Encoding from VeriFast Predicates into Implicit Dynamic Frames -- Automated Code Proofs on a Formal Model of the X86 -- Verification of a Virtual Filesystem Switch -- Verifying Chinese Train Control System under a Combined Scenario by Theorem Proving -- Formal Verification of Loop Bound Estimation for WCET Analysis -- Result Certification of Static Program Analysers with Automated Theorem Provers -- A Formally Verified Generic Branching Algorithm for Global Optimization. |
Record Nr. | UNINA-9910483036003321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2014 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|