Roberto Amadio (57 results)

Condition: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Paperback. Condition: Very Good. Sorry, No international shipping on this item.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Condition: New.

Paperback or Softback. Condition: New. Concur 2003 - Concurrency Theory: 14th International Conference, Marseille, France, September 3-5, 2003, Proceedings. Book.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Very Good. No Jacket. Hardcover 2003 library bound edition. Ex-library book with stamps and labels attached. Binding firm. Pages unmarked and clean. Laminated covers and text in very good condition. Series: Lecture Notes in Computer Science ;2761.[xi, 524 p. : ill. ; 24 cm].

Condition: New.

Condition: New.

Condition: New. In English.

Condition: New. In English.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.

Condition: New. pp. 526.

Condition: New. pp. 544.

Condition: New. Graduate text on mathematical foundations of programming languages, and operational and denotational semantics. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 504 pages, 85 b/w illus. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 154 x 30. Weight in Grams: 746. . 2008. 1st Edition. paperback. . . . . …

Paperback. Condition: Brand New. 2008 edition. 504 pages. 9.00x6.00x1.25 inches. In Stock.

Condition: New. In English.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Partial Orders and Asynchronous Systems.- Distributed Monitoring of Concurrent and Asynchronous Systems.- Synthesis of Distributed Algorithms Using Asynchronous Automata.- Compression of Partially Ordered Strings.- Process Algebra.- Bundle Event Structures and CCSP.- Syntactic Formats for Free.- Priority Rewrite Systems for OSOS Process Languages.- Games.- Quantitative Verification and Control via the Mu-Calculus.- Playing Games with Boxes and Diamonds.- The Element of Surprise in Timed Games.- Infinite Systems.- Deciding Bisimilarity between BPA and BPP Processes.- Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.- Probabilistic Automata.- Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic.- A Process-Algebraic Language for Probabilistic I/O Automata.- Compositionality for Probabilistic Automata.- Model-Checking.- Satisfiability and Model Checking for MSO-Definable Temporal Logics Are in PSPACE.- Equivalence Checking of Non-flat Systems Is EXPTIME-Hard.- Model Checking a Path.- Model-Checking and HMSC.- Multi-valued Model Checking via Classical Model Checking.- An Extension of Pushdown System and Its Model Checking Method.- Netcharts: Bridging the Gap between HMSCs and Executable Specifications.- High-Level Message Sequence Charts and Projections.- Security.- Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus.- Unifying Simulatability Definitions in Cryptographic Systems under Different Timing Assumptions.- Contract Signing, Optimism, and Advantage.- Mobility.- Full Abstraction for HOPLA.- Modeling Consensus in a Process Calculus.- Linear Forwarders.- Compositional Methods and Real Time.- Abstract Patterns of Compositional Reasoning.- Relating Fairness and Timing in Process Algebras.- A Compositional Semantic Theory for Synchronous Component-Based Design.- Probabilistic Models.- Conditional Expectation and the Approximation of Labelled Markov Processes.- Comparative Branching-Time Semantics for Markov Chains.- Quantitative Relations and Approximate Process Equivalences. …

Paperback. Condition: New. This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.…

Hardcover. Condition: Good-. Ex-lib with shelfwear, otherwise in very good condition. Binding is tight, sturdy, and square; math and text also very good. Ships from Dinkytown in Minneapolis, Minnesota.

Kartoniert / Broschiert. Condition: New. Finding Your Way in a Forest: On Different Types of Trees and Their Properties.- Simple Stochastic Games with Few Random Vertices Are Easy to Solve.- The Complexity of Nash Equilibria in Infinite Multiplayer Games.- Stochastic Games with Lossy Channels.- Si.

hardcover. Condition: Very Good. The pages are lightly tanned. The copy shows minor external wear, but is in otherwise clean condition.

Condition: New. Graduate text on mathematical foundations of programming languages, and operational and denotational semantics. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 504 pages, 85 b/w illus. BIC Classification: PBCD; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 154 x 30. Weight in Grams: 746. . 2008. 1st Edition. paperback. . . . . Books ship from the US and Ireland. …

Condition: New. pp. 504.

Taschenbuch. Condition: Neu. Neuware - ETAPS2008wasthe11thinstanceoftheEuropeanJointConferencesonTheory and Practice of Software. ETAPS is an annual federated conference that was established in 1998 by combining a number of existing and new conferences. This yearit comprised ve conferences (CC, ESOP,FASE, FOSSACS, TACAS), 22satelliteworkshops(ACCAT,AVIS,Bytecode,CMCS,COCV,DCC,FESCA, FIT, FORMED, GaLoP, GT-VMT, LDTA, MBT, MOMPES, PDMC, QAPL, RV,SafeCert,SC,SLA++P,WGT,andWRLA),ninetutorials,andseveninvited lectures (excluding those that were speci c to the satellite events). The ve main conferences received 571 submissions, 147 of which were accepted, giving an overall acceptance rate of less than 26%, with each conference below 27%. Congratulationsthereforetoallthe authorswhomadeittothe nalprogramme! I hope that most of the other authors will still have found a way of participating in this exciting event, and that you will all continue submitting to ETAPS and contributing to make of it the best conference in the area. The events that comprise ETAPS address various aspects of the system - velopment process, including speci cation, design, implementation, analysis and improvement. The languages, methodologies and tools which support these - tivities are all well within its scope. Di erent blends of theory and practice are represented, with an inclination towards theory with a practical motivation on the one hand and soundly based practice on the other. Many of the issues involved in software design apply to systems in general, including hardware s- tems, and the emphasis on software is not intended to be exclusive. …

paperback. Condition: Gut. 544 Seiten; 9783540407539.3 Gewicht in Gramm: 500.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.…

Paperback. Condition: New. This book describes the mathematical aspects of the semantics of programming languages. The main goals are to provide formal tools to assess the meaning of programming constructs in both a language-independent and a machine-independent way, and to prove properties about programs, such as whether they terminate, or whether their result is a solution of the problem they are supposed to solve. In order to achieve this the authors first present, in an elementary and unified way, the theory of certain topological spaces that have proved of use in the modelling of various families of typed lambda calculi considered as core programming languages and as meta-languages for denotational semantics. This theory is known as Domain Theory, and was founded as a subject by Scott and Plotkin. One of the main concerns is to establish links between mathematical structures and more syntactic approaches to semantics, often referred to as operational semantics, which is also described. This dual approach has the double advantage of motivating computer scientists to do some mathematics and of interesting mathematicians in unfamiliar application areas from computer science.…

Condition: New.