1. Fachtagung über Automatentheorie und Formale Sprachen [[electronic resource] ] : GI. Gesellschaft für Informatik e.V. Bonn, 9.-12. Juli 1973 / / herausgegeben von Karl-Heinz Böhling, Klaus Indermark |
Edizione | [1st ed. 1973.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1973 |
Descrizione fisica | 1 online resource (X, 330 p.) |
Disciplina | 005.11 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer programming
Computers Mathematical logic Programming Techniques Computation by Abstract Devices Mathematical Logic and Formal Languages |
ISBN | 3-540-37826-X |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | On the structure of algorithmic problems -- A mathematical model of digital computers -- On some recent problems concerning developmental languages -- Fault-tolerance and stability of fuzzy-state automata -- Bemerkungen über Homomorphismen endlicher in lineare Automaten -- Der Kaskadenzerlegungssatz für Halbautomaten -- Konvergenzbetrachtungen bei der Vorhersage des Ausgabeverhaltens allgemeiner stochastischer Systeme -- Ketten und arithmetische Prädikate von endlichen Automaten -- Une hierarchie infinie de cones d'Accepteurs verificateurs -- Zustandsfolgenabbildungen von verallgemeinerten endlichen Automaten -- Ein automatentheoretisches Modell einer Speicherhierarchie -- Deterministic one-counter automata -- The use of metric and uniform spaces for the formalization of behavioral proximity of states -- Quelques generateurs des langages algebriques -- Une caracterisation des langages quasi-rationnels standards -- Der Einfluss von Kontext auf spezielle CF-Grammatiken -- Zur Komplexität gesteuerter kontextfreier Ersetzungen -- Characterization of derivation sets of formal systems -- Die Darstellung indizierter Sprachen durch Ausdrücke -- Codes and aperiodic languages -- The characterization of certain classes of languages in the context sensitive area by automata -- A characterization of boolean closures of families of languages -- Zufällige Folgen und Bi-Immunität -- Die mittler Additionsdauer eines Paralleladdierwerks -- On the number of multiplications required by the product of two matrices -- Elementare und subelementare Funktionenklassen über binären Bäumen -- Über die Vernetzungsstruktur von Maschinen -- On the simulation of time bounded machines -- Über die Zeit, die benötigt wird, um endliche Mengen umzuordnen -- Über eine Hierarchie von Push-Down-Entscheidbaren Mengen -- A characterization of the classes L1 and R1 of primitive recursive word functions -- A drum scheduling algorithm -- Some considerations about classes of mappings between context-free derivation systems -- On ianov schemas with one memory location -- Reduction goals in bottom-up recognition -- Un modele semantique pour un langage simple de programmation -- Erweiterungen subrekursiver Programmiersprachen. |
Record Nr. | UNISA-996465422103316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1973 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
10th International Conference on Automated Deduction [[electronic resource] ] : Kaiserslautern, FRG, July 24-27, 1990. Proceedings / / edited by Mark E. Stickel |
Edizione | [1st ed. 1990.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 |
Descrizione fisica | 1 online resource (XVIII, 690 p.) |
Disciplina | 006.3 |
Collana | Lecture Notes in Artificial Intelligence |
Soggetto topico |
Artificial intelligence
Mathematical logic Artificial Intelligence Mathematical Logic and Formal Languages |
ISBN | 3-540-47171-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | A theorem prover for a computational logic -- A complete semantic back chaining proof system -- Parallelizing the closure computation in automated deduction -- Partheo: A high-performance parallel theorem prover -- Substitution-based compilation of extended rules in deductive databases -- Automatic theorem proving in paraconsistent logics: Theory and implementation -- Case-free programs: An abstraction of definite horn programs -- Generalized well-founded semantics for logic programs -- Tactical theorem proving in program verification -- Extensions to the rippling-out tactic for guiding inductive proofs -- Guiding induction proofs -- Term rewriting induction -- A resolution principle for clauses with constraints -- Str+ve: The Str+ve-based subset prover -- Ritt-Wu's decomposition algorithm and geometry theorem proving -- Encoding a dependent-type ?-calculus in a logic programming language -- Investigations into proof-search in a system of first-order dependent function types -- Equality of terms containing associative-commutative functions and commutative binding operators is isomorphism complete -- An improved general E-unification method -- Some results on equational unification -- Unification in a combination of equational theories: an efficient algorithm -- SLIM: An automated reasoner for equivalences, applied to set theory -- An examination of the prolog technology theorem-prover -- Presenting intuitive deductions via symmetric simplification -- Toward mechanical methods for streamlining proofs -- Ordered rewriting and confluence -- Complete sets of reductions with constraints -- Rewrite systems for varieties of semigroups -- Improving associative path orderings -- Perspectives on automated deduction -- On restrictions of ordered paramodulation with simplification -- Simultaneous paramodulation -- Hyper resolution and equality axioms without function substitutions -- Automatic acquisition of search guiding heuristics -- Automated reasoning contributes to mathematics and logic -- A mechanically assisted constructive proof in category theory -- Dynamic logic as a uniform framework for theorem proving in intensional logic -- A tableaux-based theorem prover for a decidable subset of default logic -- Computing prime implicants -- Minimizing the number of clauses by renaming -- Higher order E-unification -- Programming by example and proving by example using higher-order unification -- Retrieving library identifiers via equational matching of types -- Unification in monoidal theories -- A science of reasoning: Extended abstract -- The TPS theorem proving system -- Schemata -- Cylindric algebra equation solver -- The OYSTER-CLAM system -- A high-performance parallel theorem prover -- The romulus proof checker -- IMPS : An interactive mathematical proof system -- UNICOM: A refined completion based inductive theorem prover -- The theorem prover of the program verifier Tatzelwurm -- RCL: A lisp verification system -- Orme an implementation of completion procedures as sets of transitions rules -- Otter 2.0 -- Dissolver: A dissolution-based theorem prover -- TRIP: An implementation of clausal rewriting -- OSCAR -- Expert thinker: An adaptation of F-Prolog to microcomputers -- A prolog technology theorem prover -- A general clause theorem prover -- Liss — The logic inference search system -- ACE: The abstract clause engine -- Tutorial on high-performance automated theorem proving -- Tutorial on reasoning and representation with concept languages -- Tutorial on ?Prolog -- Tutorial on equational unification -- Tutorial on compilation techniques for logics -- Tutorial on high-performance theorem provers: Efficient implementation and parallelisation -- Tutorial on rewrite-based theorem proving -- Tutorial on program-synthetic deduction -- Tutorial on computing models of propositional logics. |
Record Nr. | UNISA-996465843003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1990 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
12 × 12 Schlüsselkonzepte zur Mathematik [[electronic resource] /] / von Oliver Deiser, Caroline Lasser, Elmar Vogt, Dirk Werner |
Autore | Deiser Oliver |
Edizione | [2nd ed. 2016.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer Spektrum, , 2016 |
Descrizione fisica | 1 online resource (XIII, 355 S. 44 Abb., 1 Abb. in Farbe.) |
Disciplina | 515 |
Soggetto topico |
Mathematical analysis
Analysis (Mathematics) Matrix theory Algebra Discrete mathematics Mathematical logic Analysis Linear and Multilinear Algebras, Matrix Theory Discrete Mathematics Mathematical Logic and Foundations |
ISBN | 3-662-47077-2 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | ger |
Nota di contenuto | 1 Grundlagen -- 2 Zahlen -- 3 Zahlentheorie -- 4 Diskrete Mathematik -- 5 Lineare Algebra -- 6 Algebra -- 7 Elementare Analysis -- 8 Höhere Analysis -- 9 Topologie und Geometrie -- 10 Numerik -- 11 Stochastik -- 12 Mengenlehre und Logik -- Index. |
Record Nr. | UNINA-9910484823003321 |
Deiser Oliver
![]() |
||
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer Spektrum, , 2016 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
A 25-Year Perspective on Logic Programming [[electronic resource] ] : Achievements of the Italian Association for Logic Programming, GULP / / edited by Agostino Dovier, Enrico Pontelli |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 329 p. 21 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Mathematical logic Computer logic Computer programming Computer science—Mathematics Computers Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques Mathematics of Computing Theory of Computation |
ISBN |
1-280-38788-2
9786613565808 3-642-14309-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Twenty-Five Years of Logic Programming in Italy -- Logic Programming in Italy: A Historical Perspective -- Theoretical Foundations and Semantics of Logic Programming -- Theory-Specific Automated Reasoning -- Constraint Logic Programming -- Knowledge Representation and Non-monotonic Reasoning -- The Transformational Approach to Program Development -- Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming -- Answer Set Programming -- Logic Programming Languages for Databases and the Web -- Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How? -- Concurrent and Reactive Constraint Programming -- Proof-Theoretic and Higher-Order Extensions of Logic Programming -- Transformation and Debugging of Functional Logic Programs -- 25 Years of Applications of Logic Programming in Italy. |
Record Nr. | UNISA-996465635203316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
A 25-Year Perspective on Logic Programming : Achievements of the Italian Association for Logic Programming, GULP / / edited by Agostino Dovier, Enrico Pontelli |
Edizione | [1st ed. 2010.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
Descrizione fisica | 1 online resource (XIV, 329 p. 21 illus.) |
Disciplina | 005.1 |
Collana | Programming and Software Engineering |
Soggetto topico |
Software engineering
Mathematical logic Computer logic Computer programming Computer science—Mathematics Computers Software Engineering/Programming and Operating Systems Mathematical Logic and Formal Languages Logics and Meanings of Programs Programming Techniques Mathematics of Computing Theory of Computation |
ISBN |
1-280-38788-2
9786613565808 3-642-14309-1 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Twenty-Five Years of Logic Programming in Italy -- Logic Programming in Italy: A Historical Perspective -- Theoretical Foundations and Semantics of Logic Programming -- Theory-Specific Automated Reasoning -- Constraint Logic Programming -- Knowledge Representation and Non-monotonic Reasoning -- The Transformational Approach to Program Development -- Static Analysis, Abstract Interpretation and Verification in (Constraint Logic) Programming -- Answer Set Programming -- Logic Programming Languages for Databases and the Web -- Agents, Multi-Agent Systems and Declarative Programming: What, When, Where, Why, Who, How? -- Concurrent and Reactive Constraint Programming -- Proof-Theoretic and Higher-Order Extensions of Logic Programming -- Transformation and Debugging of Functional Logic Programs -- 25 Years of Applications of Logic Programming in Italy. |
Record Nr. | UNINA-9910483881603321 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
5th Conference on Automated Deduction Les Arcs, France, July 8-11, 1980 |
Pubbl/distr/stampa | Springer Berlin Heidelberg, 1980 |
Descrizione fisica | 1 online resource |
Altri autori (Persone) |
BibelWolfgang
KowalskiRobert |
Soggetto topico |
Mathematics
Mathematical logic |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Record Nr. | UNISA-996465762203316 |
Springer Berlin Heidelberg, 1980 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
6th Conference on Automated Deduction [[electronic resource] ] : New York, USA, June 7-9, 1982 / / edited by D. W. Loveland |
Edizione | [1st ed. 1982.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1982 |
Descrizione fisica | 1 online resource (VII, 389 p.) |
Disciplina | 005.131 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Mathematical Logic and Formal Languages |
ISBN | 3-540-39240-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Solving open questions with an automated theorem-proving program -- STP: A mechanized logic for specification and verification -- A look at TPS -- Logic machine architecture: Kernel functions -- Logic machine architecture: Inference mechanisms -- Procedure implementation through demodulation and related tricks -- The application of Homogenization to simultaneous equations -- Meta-level inference and program verification -- An example of FOL using metatheory -- Comparison of natural deduction and locking resolution implementations -- Derived preconditions and their use in program synthesis -- Automatic construction of special purpose programs -- Deciding combinations of theories -- Exponential improvement of efficient backtracking -- Exponential improvement of exhaustive backtracking: data structure and implementation -- Intuitionistic basis for non-monotonic logic -- Knowledge retrieval as limited inference -- On indefinite databases and the closed world assumption -- Proof by matrix reduction as plan + validation -- Improvements of a tautology-testing algorithm -- Representing infinite sequences of resolvents in recursive First-Order Horn Databases -- The power of the Church-Rosser property for string rewriting systems -- Universal unification and a classification of equational theories. |
Record Nr. | UNISA-996466349003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1982 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
8th International Conference on Automated Deduction [[electronic resource] ] : Oxford, England, July 27- August 1, 1986. Proceedings / / edited by Jörg H. Siekmann |
Edizione | [1st ed. 1986.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 |
Descrizione fisica | 1 online resource (XII, 716 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Artificial intelligence Mathematical Logic and Foundations Mathematical Logic and Formal Languages Artificial Intelligence |
ISBN | 3-540-39861-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Connections and higher-order logic -- Commutation, transformation, and termination -- Full-commutation and fair-termination in equational (and combined) term-rewriting systems -- An actual implementation of a procedure that mechanically proves termination of rewriting systems based on inequalities between polynomial interpretations -- Proving termination of associative commutative rewriting systems by rewriting -- Relating resolution and algebraic completion for Horn logic -- A simple non-termination test for the Knuth-Bendix method -- A new formula for the execution of categorical combinators -- Proof by induction using test sets -- How to prove equivalence of term rewriting systems without induction -- Sufficient completeness, term rewriting systems and ”anti-unification” -- A new method for establishing refutational completeness in theorem proving -- A theory of diagnosis from first principles -- Some contributions to the logical analysis of circumscription -- Modal theorem proving -- Computational aspects of three-valued logic -- Resolution and quantified epistemic logics -- A commonsense theory of nonmonotonic reasoning -- Negative paramodulation -- The heuristics and experimental results of a new hyperparamodulation: HL-resolution -- ECR: An equality conditional resolution proof procedure -- Using narrowing to do isolation in symbolic equation solving — an experiment in automated reasoning -- Formulation of induction formulas in verification of prolog programs -- Program verifier "Tatzelwurm": Reasoning about systems systems of linear inequalities -- An interactive verification system based on dynamic logic -- What you always wanted to know about clause graph resolution -- Parallel theorem proving with connection graphs -- Theory links in semantic graphs -- Abstraction using generalization functions -- An improvement of deduction plans: Refutation plans -- Controlling deduction with proof condensation and heuristics -- Nested resolution -- Mechanizing constructive proofs -- Implementing number theory: An experiment with Nuprl -- Parallel algorithms for term matching -- Unification in combinations of collapse-free theories with disjoint sets of function symbols -- Combination of unification algorithms -- Unification in the data structure sets -- NP-completeness of the set unification and matching problems -- Matching with distributivity -- Unification in boolean rings -- Some relationships between unification, restricted unification, and matching -- A classification of many-sorted unification problems -- Unification in many-sorted equational theories -- Classes of first order formulas under various satisfiability definitions -- Diamond formulas in the dynamic logic of recursively enumerable programs -- A prolog machine -- A prolog technology theorem prover: Implementation by an extended prolog compiler -- Paths to high-performance automated theorem proving -- Purely functional implementation of a logic -- Causes for events: Their computation and applications -- How to clear a block: Plan formation in situational logic -- Deductive synthesis of sorting programs -- The TPS theorem proving system -- Trspec: A term rewriting based system for algebraic specifications -- Highly parallel inference machine -- Automatic theorem proving in the ISDV system -- The karlsruhe induction theorem proving system -- Overview of a theorem-prover for a computational logic -- GEO-prover — A geometry theorem prover developed at UT -- The markgraf karl refutation procedure (MKRP) -- The J-machine: Functional programming with combinators -- The illinois prover: A general purpose resolution theorem prover -- Theorem proving systems of the Formel project -- The passau RAP system: Prototyping algebraic specifications using conditional narrowing -- RRL: A rewrite rule laboratory -- A geometry theorem prover based on Buchberger's algorithm -- REVE a rewrite rule laboratory -- ITP at argonne national laboratory -- Autologic at university of victoria -- Thinker -- The KLAUS automated deduction system -- The KRIPKE automated theorem proving system -- SHD-prover at university of texas at austin. |
Record Nr. | UNISA-996465940003316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1986 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
9th International Conference on Automated Deduction [[electronic resource] ] : Argonne, Illinois, USA, May 23-26, 1988. Proceedings / / edited by Ewing Lusk, Ross Overbeek |
Edizione | [1st ed. 1988.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 |
Descrizione fisica | 1 online resource (X, 776 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Mathematical logic
Mathematical Logic and Foundations Mathematical Logic and Formal Languages |
ISBN | 3-540-39216-5 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | First-order theorem proving using conditional rewrite rules -- Elements of Z-module reasoning -- Learning and applying generalised solutions using higher order resolution -- Specifying theorem provers in a higher-order logic programming language -- Query processing in quantitative logic programming -- An environment for automated reasoning about partial functions -- The use of explicit plans to guide inductive proofs -- Logicalc: An environment for interactive proof development -- Implementing verification strategies in the KIV-system -- Checking natural language proofs -- Consistency of rule-based expert systems -- A mechanizable induction principle for equational specifications -- Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time -- Towards efficient "knowledge-based" automated theorem proving for non-standard logics -- Propositional temporal interval logic is PSPACE complete -- Computational metatheory in Nuprl -- Type inference in Prolog -- Procedural interpretation of non-horn logic programs -- Recursive query answering with non-horn clauses -- Case inference in resolution-based languages -- Notes on Prolog program transformations, Prolog style, and efficient compilation to the Warren abstract machine -- Exploitation of parallelism in prototypical deduction problems -- A decision procedure for unquantified formulas of graph theory -- Adventures in associative-commutative unification (A summary) -- Unification in finite algebras is unitary(?) -- Unification in a combination of arbitrary disjoint equational theories -- Partial unification for graph based equational reasoning -- SATCHMO: A theorem prover implemented in Prolog -- Term rewriting: Some experimental results -- Analogical reasoning and proof discovery -- Hyper-chaining and knowledge-based theorem proving -- Linear modal deductions -- A resolution calculus for modal logics -- Solving disequations in equational theories -- On word problems in Horn theories -- Canonical conditional rewrite systems -- Program synthesis by completion with dependent subtypes -- Reasoning about systems of linear inequalities -- A subsumption algorithm based on characteristic matrices -- A restriction of factoring in binary resolution -- Supposition-based logic for automated nonmonotonic reasoning -- Argument-bounded algorithms as a basis for automated termination proofs -- Two automated methods in implementation proofs -- A new approach to universal unfication and its application to AC-unification -- An implementation of a dissolution-based system employing theory links -- Decision procedure for autoepistemic logic -- Logical matrix generation and testing -- Optimal time bounds for parallel term matching -- Challenge equality problems in lattice theory -- Single axioms in the implicational propositional calculus -- Challenge problems focusing on equality and combinatory logic: Evaluating automated theorem-proving programs -- Challenge problems from nonassociative rings for theorem provers -- An interactive enhancement to the Boyer-Moore theorem prover -- A goal directed theorem prover -- m-NEVER system summary -- EFS — An interactive Environment for Formal Systems -- Ontic: A knowledge representation system for mathematics -- Some tools for an inference laboratory (ATINF) -- Quantlog: A system for approximate reasoning in inconsistent formal systems -- LP: The larch prover -- The KLAUS automated deduction system -- A Prolog technology theorem prover -- ?Prolog: An extended logic programming language -- SYMEVAL: A theorem prover based on the experimental logic -- ZPLAN: An automatic reasoning system for situations -- The TPS theorem proving system -- MOLOG: A modal PROLOG -- PARTHENON: A parallel theorem prover for non-horn clauses -- An nH-Prolog implementation -- RRL: A rewrite rule laboratory -- Geometer: A theorem prover for algebraic geometry -- Isabelle: The next seven hundred theorem provers -- The CHIP system : Constraint handling in Prolog. |
Record Nr. | UNISA-996465689403316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1988 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Abstract State Machines - Theory and Applications [[electronic resource] ] : International Workshop, ASM 2000 Monte Verita, Switzerland, March 19-24, 2000 Proceedings / / edited by Yuri Gurevich, Philipp W. Kutter, Martin Odersky, Lothar Thiele |
Edizione | [1st ed. 2000.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 |
Descrizione fisica | 1 online resource (X, 386 p.) |
Disciplina | 511.3 |
Collana | Lecture Notes in Computer Science |
Soggetto topico |
Computer logic
Software engineering Programming languages (Electronic computers) Mathematical logic Database management Logics and Meanings of Programs Software Engineering/Programming and Operating Systems Programming Languages, Compilers, Interpreters Software Engineering Mathematical Logic and Formal Languages Database Management |
ISBN | 3-540-44518-8 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Abstract State Machines at the Cusp of the Millenium -- Mathematical Foundations -- Abstract State Machines and Pure Mathematics -- Abstract State Machines and Computationally Complete Query Languages -- On Verification of Refinements of Timed Distributed Algorithms -- Abstract State Machine Languages -- Objects + Views = Components? -- XASM- An Extensible, Component-Based Abstract State Machines Language -- Generic Facilities in Object-Oriented ASMs -- Distribution and Concurrency -- Towards an ASM Thesis for Unconventional Algorithms -- Partially Ordered Runs: A Case Study -- Investigating Java Concurrency Using Abstract State Machines -- Compilers and Semantics -- Verifying Compilers and ASMs or ASMs for Uniform Description of Multistep Transformations -- An ASM Dynamic Semantics for Standard ML -- Modeling the Dynamics of UML State Machines -- On the Formal Semantics of SDL-2000:A Compilation Approach Based on an Abstract SDL Machine -- Description and Simulation of Microprocessor Instruction Sets Using ASMs -- Automatic Verication and Model Checking -- Symbolic Analysis of Transition Systems? -- Encoding Abstract State Machines in PVS -- Model Checking Abstract State Machines and Beyond -- Towards a Methodology for Model Checking ASM: Lessons Learned from the FLASH Case Study -- Industrial Applications -- Report on a Practical Application of ASMs in Software Design -- Using Abstract State Machines at Microsoft: A Case Study. |
Record Nr. | UNISA-996466355503316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2000 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|