Notice bibliographique

  • Notice

Type(s) de contenu et mode(s) de consultation : Texte : électronique

Auteur(s) : FOSSACS Conference (15 ; 2012 ; Tallinn, Estonia)  Voir les notices liées en tant qu'auteur

Titre(s) : Foundations of software science and computational structures [Texte électronique] : 15th International Conference, FOSSACS 2012, held as part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24-April 1, 2012. Proceedings / Lars Birkedal (ed.)

Publication : . - Berlin ; New York : Springer, cop. 2012

Description matérielle : 1 online resource (xvii, 484 pages)

Collection : (Lecture notes in computer science ; 7213. Advanced research in computing and software science)
(LNCS sublibrary. SL 1, Theoretical computer science and general issues)

Note(s) : Includes bibliographical references and author index
. - Online resource; title from PDF title page (SpringerLink, viewed October 27, 2014).
Annotation ; This book constitutes the proceedings of the 15th International Conference on Foundations of Software Science and Computational Structures, FOSSACS 2012, held as part of the joint European Conference on Theory and Practice of Software, ETAPS 2012, which took place in Tallinn, Estonia, in March/April 2012. The 29 papers presented in this book together with two invited talks in full paper length were carefully reviewed and selected from 100 full paper submissions. The papers deal with theories and methods to support analysis, synthesis, transformation and verification of programs and software systems

Autre(s) auteur(s) : Birkedal, Lars. Fonction indéterminée  Voir les notices liées en tant qu'auteur
ETAPS Conference (2012 ; Tallinn, Estonia). Fonction indéterminée  Voir les notices liées en tant qu'auteur

Autre(s) forme(s) du titre : 
- Autre forme du titre : FOSSACS 2012
- Autre forme du titre : ETAPS 2012

Sujet(s) : Génie logiciel  Voir les notices liées en tant que sujet
Logiciels  Voir les notices liées en tant que sujet
Informatique  Voir les notices liées en tant que sujet

Indice(s) Dewey : 005.1 (23e éd.)  Voir les notices liées en tant que sujet ; 005.131 (23e éd.)  Voir les notices liées en tant que sujet

Numéros : ISBN 9783642287299

Notice n° :  FRBNF44704130 (notice reprise d'un réservoir extérieur)

Table des matières : Querying UML Class Diagrams /Andrea Calì, Georg Gottlob, Giorgio Orsi and Andreas Pieris ; Bicategories of Concurrent Games /(Invited Paper)Glynn Winskel ; Fibrational Induction Meets Effects /Robert Atkey, Neil Ghani, Bart Jacobs and Patricia Johann ; A Coalgebraic Perspective on Minimization and Determinization /Jiří Adámek, Filippo Bonchi, Mathias Hülsbusch, Barbara König and Stefan Milius, et al. ; When Is a Container a Comonad? /Danel Ahman, James Chapman and Tarmo Uustalu ; Well-Pointed Coalgebras (Extended Abstract) /Jiří Adámek, Stefan Milius, Lawrence S. Moss and Lurdes Sousa ; Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs /Ana Bove, Peter Dybjer and Andrés Sicard-Ramírez ; Applicative Bisimulations for Delimited-Control Operators /Dariusz Biernacki and Sergueï Lenglet ; Effective Characterizations of Simple Fragments of Temporal Logic Using Prophetic Automata /Sebastian Preugschat and Thomas Wilke ; Impro
Extending H11-Clauses with Path Disequalities /Helmut Seidl and Andreas Reuß ; Brookes Is Relaxed, Almost! /Radha Jagadeesan, Gustavo Petri and James Riely ; Revisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes /Marco Bernardo, Rocco De Nicola and Michele Loreti ; Is It a "Good" Encoding of Mixed Choice? /Kirstin Peters and Uwe Nestmann ; Event Structure Semantics of Parallel Extrusion in the Pi-Calculus /Silvia Crafa, Daniele Varacca and Nobuko Yoshida ; Narcissists Are Easy, Stepmothers Are Hard /Daniel Gorín and Lutz Schröder ; On Nominal Regular Languages with Binders /Alexander Kurz, Tomoyuki Suzuki and Emilio Tuosto ; Robustness of Structurally Equivalent Concurrent Parity Games /Krishnendu Chatterjee ; Subgame Perfection for Equilibria in Quantitative Reachability Games /Thomas Brihaye, Véronique Bruyère, Julie De Pril and Hugo Gimbert ; Concurrent Games with Ordered Objectives /Patricia Bouyer, Romain Brenguier, Nicolas Markey and Michael U
On Distributability of Petri Nets /(Extended Abstract)Rob van Glabbeek, Ursula Goltz and Jens-Wolfhard Schicke-Uffmann ; Functions as Session-Typed Processes /Bernardo Toninho, Luis Caires and Frank Pfenning ; Deriving Bisimulation Congruences for Conditional Reactive Systems /Mathias Hülsbusch and Barbara König ; First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time /Alexander Kartzow ; Model Checking Languages of Data Words /Benedikt Bollig, Aiswarya Cyriac, Paul Gastin and K. Narayan Kumar ; Branching-Time Model Checking of Parametric One-Counter Automata /Stefan Göller, Christoph Haase, Joël Ouaknine and James Worrell ; Synthesizing Probabilistic Composers /Sumit Nain and Moshe Y. Vardi ; On the Complexity of Computing Probabilistic Bisimilarity /Di Chen, Franck van Breugel and James Worrell ; Probabilistic Transition System Specification: Congruence and Full Abstraction of Bisimulation /Pedro Rubén D'Argenio and Matias David Lee ; On th

Localiser ce document(1 Exemplaire)

Document numérique : 

1 partie d'exemplaire regroupée

support : document électronique dématérialisé