feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Type of Medium
Language
Region
Subjects(RVK)
Access
  • 1
    UID:
    b3kat_BV041964162
    Format: 1 Online-Ressource
    ISBN: 9783540591320
    Series Statement: Lecture notes in computer science 906
    Additional Edition: Erscheint auch als Druckausgabe ISBN 978-3-540-49198-9
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Abstrakter Datentyp ; Algebraische Spezifikation ; Abstrakter Datentyp ; Spezifikation ; Konferenzschrift
    Author information: Astesiano, Egidio 1939-
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    UID:
    b3kat_BV035775228
    Format: 1 Online-Ressource (XI, 435 S.)
    ISBN: 3540543457 , 0387543457
    Series Statement: Lecture notes in computer science 520
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Informatik ; Datenverarbeitung ; Mathematik ; Grundlage ; Theoretische Informatik ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    UID:
    almafu_9959186366202883
    Format: 1 online resource (XI, 437 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47579-6
    Series Statement: Lecture Notes in Computer Science, 520
    Content: This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
    Note: Bibliographic Level Mode of Issuance: Monograph , Elimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54345-7
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    UID:
    almahu_9947920448002882
    Format: XI, 522 p. , online resource.
    ISBN: 9783540301240
    Series Statement: Lecture Notes in Computer Science, 3210
    Note: Invited Lectures -- Notions of Average-Case Complexity for Random 3-SAT -- Abstract Interpretation of Proofs: Classical Propositional Calculus -- Applications of Craig Interpolation to Model Checking -- Bindings, Mobility of Bindings, and the ?-Quantifier: An Abstract -- My (Un)Favourite Things -- Regular Papers -- On Nash Equilibria in Stochastic Games -- A Bounding Quantifier -- Parity and Exploration Games on Infinite Graphs -- Integrating Equational Reasoning into Instantiation-Based Theorem Proving -- Goal-Directed Methods for ?ukasiewicz Logic -- A General Theorem on Termination of Rewriting -- Predicate Transformers and Linear Logic: Yet Another Denotational Model -- Structures for Multiplicative Cyclic Linear Logic: Deepness vs Cyclicity -- On Proof Nets for Multiplicative Linear Logic with Units -- The Boundary Between Decidability and Undecidability for Transitive-Closure Logics -- Game-Based Notions of Locality Over Finite Models -- Fixed Points of Type Constructors and Primitive Recursion -- On the Building of Affine Retractions -- Higher-Order Matching in the Linear ?-calculus with Pairing -- A Dependent Type Theory with Names and Binding -- Towards Mechanized Program Verification with Separation Logic -- A Functional Scenario for Bytecode Verification of Resource Bounds -- Proving Abstract Non-interference -- Intuitionistic LTL and a New Characterization of Safety and Liveness -- Moving in a Crumbling Network: The Balanced Case -- Parameterized Model Checking of Ring-Based Message Passing Systems -- A Third-Order Bounded Arithmetic Theory for PSPACE -- Provably Total Primitive Recursive Functions: Theories with Induction -- Logical Characterizations of PSPACE -- The Logic of the Partial ?-Calculus with Equality -- Complete Lax Logical Relations for Cryptographic Lambda-Calculi -- Subtyping Union Types -- Pfaffian Hybrid Systems -- Axioms for Delimited Continuations in the CPS Hierarchy -- Set Constraints on Regular Terms -- Unsound Theorem Proving -- A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation -- Automated Generation of Analytic Calculi for Logics with Linearity.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540230243
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (Online Access)
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 5
    UID:
    almahu_BV004565186
    Format: XI, 435 S.
    ISBN: 3-540-54345-7 , 0-387-54345-7
    Series Statement: Lecture notes in computer science 520
    Note: Literaturangaben
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Datenverarbeitung ; Mathematik ; Informatik ; Datenverarbeitung ; Mathematik ; Grundlage ; Theoretische Informatik ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 6
    UID:
    gbv_595128106
    Format: Online-Ressource (XI, 435 S.)
    Edition: Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
    ISBN: 9783540475798
    Series Statement: Lecture notes in computer science 520
    Content: Elimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power.
    Content: This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
    Note: Literaturangaben
    Additional Edition: ISBN 3540543457
    Additional Edition: ISBN 9783540543459
    Additional Edition: Erscheint auch als Druck-Ausgabe Mathematical foundations of computer science, 1991 Berlin : Springer, 1991 ISBN 3540543457
    Additional Edition: ISBN 0387543457
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift ; Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 7
    UID:
    almahu_9947363958502882
    Format: XIV, 558 p. , online resource.
    ISBN: 9783540317142
    Series Statement: Lecture Notes in Computer Science, 3582
    Content: This volume contains the proceedings of Formal Methods 2005, the 13th InternationalSymposiumonFormalMethodsheldinNewcastleuponTyne,UK, during July 18–22, 2005. Formal Methods Europe (FME, www.fmeurope.org) is an independent association which aims to stimulate the use of, and research on, formal methods for system development. FME conferences began with a VDM Europe symposium in 1987. Since then, the meetings have grown and have been held about once every 18 months. Throughout the years the symposia have been notablysuccessfulinbringingtogetherresearchers,tooldevelopers,vendors,and users, both from academia and from industry. Formal Methods 2005 con?rms this success. We received 130 submissions to the main conference, from all over the world. Each submission was carefully refereed by at least three reviewers. Then, after an intensive, in-depth discussion, the Program Committee selected 31 papers for presentation at the conference. They form the bulk of this volume. We would like to thank all the Program Committee members and the referees for their excellent and e?cient work. Apart from the selected contributions, the Committee invited three keynote lectures from Mathai Joseph, Marie-Claude Gaudel and Chris Johnson. You will ?nd the abstracts/papers for their keynote lectures in this volume as well. AninnovationfortheFM2005programwasapaneldiscussiononthehistory of formal methods, with Jean-Raymond Abrial, Dines Bjørner, Jim Horning and Cli? Jones as panelists. Unfortunately, it was not possible to re?ect this event in the current volume, but you will ?nd the material documenting it elsewhere (see the conference Web page).
    Note: Keynote Talks -- Formal Aids for the Growth of Software Systems -- Formal Methods and Testing: Hypotheses, and Correctness Approximations -- The Natural History of Bugs: Using Formal Methods to Analyse Software Related Failures in Space Missions -- Object Orientation -- Modular Verification of Static Class Invariants -- Decoupling in Object Orientation -- Controlling Object Allocation Using Creation Guards -- Symbolic Animation of JML Specifications -- Resource Analysis and Verification -- Certified Memory Usage Analysis -- Compositional Specification and Analysis of Cost-Based Properties in Probabilistic Programs -- Formally Defining and Verifying Master/Slave Speculative Parallelization -- Timing and Testing -- Systematic Implementation of Real-Time Models -- Timing Tolerances in Safety-Critical Software -- Timed Testing with TorX -- Automatic Verification and Conformance Testing for Validating Safety Properties of Reactive Systems -- CSP, B and Circus -- Adding Conflict and Confusion to CSP -- Combining CSP and B for Specification and Property Verification -- Operational Semantics for Model Checking Circus -- Control Law Diagrams in Circus -- Security -- Verification of a Signature Architecture with HOL-Z -- End-to-End Integrated Security and Performance Analysis on the DEGAS Choreographer Platform -- Formal Verification of Security Properties of Smart Card Embedded Source Code -- Networks and Processes -- A Formal Model of Addressing for Interoperating Networks -- An Approach to Unfolding Asynchronous Communication Protocols -- Semantics of BPEL4WS-Like Fault and Compensation Handling -- Abstraction, Retrenchment and Rewriting -- On Some Galois Connection Based Abstractions for the Mu-Calculus -- Retrenching the Purse: Finite Sequence Numbers, and the Tower Pattern -- Strategic Term Rewriting and Its Application to a Vdm-sl to Sql Conversion -- Scenarios and Modeling Languages -- Synthesis of Distributed Processes from Scenario-Based Specifications -- Verifying Scenario-Based Aspect Specifications -- An MDA Approach Towards Integrating Formal and Informal Modeling Languages -- Model Checking -- Model-Checking of Specifications Integrating Processes, Data and Time -- Automatic Symmetry Detection for Model Checking Using Computational Group Theory -- On Partitioning and Symbolic Model Checking -- Dynamic Component Substitutability Analysis -- Industry Day: Abstracts of Invited Talks -- Floating-Point Verification -- Preliminary Results of a Case Study: Model Checking for Advanced Automotive Applications -- Model-Based Testing in Practice -- Testing Concurrent Object-Oriented Systems with Spec Explorer -- ASD Case Notes: Costs and Benefits of Applying Formal Methods to Industrial Control Software -- The Informal Nature of Systems Engineering.
    In: Springer eBooks
    Additional Edition: Printed edition: ISBN 9783540278825
    Language: English
    Subjects: Computer Science
    RVK:
    Keywords: Konferenzschrift
    URL: Volltext  (lizenzpflichtig)
    URL: Volltext  (lizenzpflichtig)
    URL: Cover
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 8
    UID:
    edoccha_9959186366202883
    Format: 1 online resource (XI, 437 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47579-6
    Series Statement: Lecture Notes in Computer Science, 520
    Content: This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
    Note: Bibliographic Level Mode of Issuance: Monograph , Elimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54345-7
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 9
    UID:
    edocfu_9959186366202883
    Format: 1 online resource (XI, 437 p.)
    Edition: 1st ed. 1991.
    Edition: Online edition Springer Lecture Notes Archive ; 041142-5
    ISBN: 3-540-47579-6
    Series Statement: Lecture Notes in Computer Science, 520
    Content: This volume contains the proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS '91, held in Kazimierz Dolny, Poland, September 9-13, 1991. The series of MFCS symposia, organized alternately in Poland and Czechoslovakia since 1972, has a long and well established tradition. The purpose of the series is to encourage high-quality research in all branches of theoretical computer science and to bring together specialists working actively in the area. Principal areas of interest in this symposium include: software specification and development, parallel and distributed computing, logic and semantics of programs, algorithms, automata and formal languages, complexity and computability theory, and others. The volume contains 5 invited papers by distinguished scientists and 38 contributions selected from a total of 109 submitted papers.
    Note: Bibliographic Level Mode of Issuance: Monograph , Elimination of negation in term algebras -- Rewrite orderings and termination of rewrite systems -- On the faithfulness of formal models -- Models for concurrency -- On a hierarchy of file types and a tower of their theories -- Strong conjunction and intersection types -- Partial higher-order specifications -- Unification in incompletely specified theories: A case study -- Observing localities -- Abstract dynamic data types: A temporal logic approach -- Generating words by cellular automata -- Atomic refinement in process description languages -- Recognizable complex trace languages (abstract) -- Solving systems of linear diophantine equations: An algebraic approach -- A second-order pattern matching algorithm for the cube of typed ?-calculi -- The lazy call-by-value ?-calculus -- The limit of split n -bisimulations for CCS agents -- Stochastic automata and length distributions of rational languages -- Towards a categorical semantics of type classes -- Single-path Petri nets -- The bisection problem for graphs of degree 4 (configuring transputer systems) -- Some results concerning 2-D on-line tessellation acceptors and 2-D alternating finite automata -- Infinite normal forms for non-linear term rewriting systems -- Two algorithms for approxmate string matching in static texts -- Efficient constructions of test sets for regular and context-free languages -- The complexity of the reliable connectivity problem -- Pattern matching in order-sorted languages -- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus -- A solution of the complement problem in associatiue-commutatiue theories -- A model for real-time systems -- On strict codes -- A decidable case of the semi-unification problem -- Maintaining dictionaries in a hierarchical memory -- Upper and lower bounds for certain GRAPH-ACCESSIBILITY-PROBLEMs on bounded alternating ?-BRANCHING PROGRAMs -- CCS dynamic bisimulation is progressing -- Syntax and semantics of a monotonic framework for non-monotonic reasoning -- On the cardinality of sets of infinite trees recognizable by finite automata -- Extending temporal logic by explicit concurrency -- An extensional partial combinatory algebra based on ?-terms -- Once more on order-sorted algebras -- Composition of two semi commutations -- An efficient decision algorithm for the uniform semi-unification problem extended abstract -- Different modifications of pointer machines and their computational power. , English
    In: Springer eBooks
    Additional Edition: ISBN 3-540-54345-7
    Language: English
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 10
    UID:
    gbv_181647532
    Format: VIII, 523 S. , graph. Darst.
    ISBN: 354059132X , 038759132X
    Series Statement: Lecture notes in computer science 906
    Note: Literaturangaben
    Additional Edition: Online-Ausg. Recent trends in data type specification Berlin [u.a.] : Springer, 1995 ISBN 9783540491989
    Additional Edition: Erscheint auch als Online-Ausgabe Astesiano, Egidio Recent Trends in Data Type Specification Berlin, Heidelberg : Springer Berlin Heidelberg, 1995 ISBN 9783540491989
    Language: English
    Subjects: Computer Science
    RVK:
    RVK:
    RVK:
    Keywords: Abstrakter Datentyp ; Spezifikation ; Abstrakter Datentyp ; Abstrakter Datentyp ; Algebraische Spezifikation ; Konferenzschrift ; Konferenzschrift ; Konferenzschrift
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. Further information can be found on the KOBV privacy pages