Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFormal Aspects of Computing, Volume 29
Volume 29, Number 1, January 2017
- Maurizio Proietti, Hirohisa Seki, Jim Woodcock
:
Editorial. 1-2 - Roberto Giacobazzi, Isabella Mastroeni, Mila Dalla Preda:
Maximal incompleteness as obfuscation potency. 3-31 - Aziem Chawdhary, Ranjeet Singh, Andy King:
Partial evaluation of string obfuscations for Java malware detection. 33-55 - Henning Christiansen, Maja H. Kirkeby:
On proving confluence modulo equivalence for Constraint Handling Rules. 57-95 - Emilio Jesús Gallego Arias, James Lipton, Julio Mariño:
Constraint logic programming with a relational machine. 97-124 - Vincent Nys, Danny De Schreye:
Abstract conjunctive partial deduction for the analysis and compilation of coroutines. 125-153 - Wlodzimierz Drabent:
Proving completeness of logic programs with the cut. 155-172
Volume 29, Number 2, March 2017
- Amílcar Sernadas. 173
- Dines Bjørner:
Manifest domains: analysis and description. 175-225 - Qin Li, Graeme Smith:
Refining autonomous agents with declarative beliefs and desires. 227-249 - Anirban Bhattacharyya, Andrey Mokhov, Ken Pierce:
An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems. 251-307 - Adrián Riesco, Kazuhiro Ogata, Kokichi Futatsugi:
A Maude environment for CafeOBJ. 309-334 - Wen-ling Huang, Jan Peleska:
Complete model-based equivalence class testing for nondeterministic systems. 335-364 - Kunal Banerjee, Dipankar Sarkar, Chittaranjan A. Mandal:
Deriving bisimulation relations from path based equivalence checkers. 365-379
Volume 29, Number 3, May 2017
- Moreno Falaschi, Augusto Sampaio:
Editorial. 381-382 - Dale Miller:
Proof checking and logic programming. 383-399 - Hirohisa Seki:
On dual programs in co-logic programming and the Horn μ -calculus. 401-421 - José Meseguer, Stephen Skeirik:
Equational formulas and pattern operations in initial order-sorted algebras. 423-452 - Peng Fu, Ekaterina Komendantskaya:
Operational semantics of resolution and productivity in Horn clause logic. 453-474 - Sergio Antoy, Michael Hanus:
Transforming Boolean equalities into constraints. 475-494 - Dipak L. Chaudhari, Om P. Damani:
Assumption propagation through annotated programs. 495-530 - Marco Comini, María-del-Mar Gallardo, Laura Titolo, Alicia Villanueva:
A program analysis framework for tccp based on abstract interpretation. 531-557 - Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Optimizing sorting algorithms by using sorting networks. 559-579
Volume 29, Number 4, July 2017
- Xuandong Li, Zhiming Liu:
Editorial. 581-582 - Gregor von Bochmann, Martin Hilscher, Sven Linker, Ernst-Rüdiger Olderog:
Synthesizing and verifying controllers for multi-lane traffic maneuvers. 583-600 - David Faitelson, Shmuel S. Tyszberowicz:
Improving design decomposition (extended version). 601-627 - Hassan Hatefi, Ralf Wimmer, Bettina Braitling, Luis María Ferrer Fioriti, Bernd Becker, Holger Hermanns:
Cost vs. time in stochastic games and Markov automata. 629-649 - Sebastian Junges, Dennis Guck, Joost-Pieter Katoen, Arend Rensink, Mariëlle Stoelinga:
Fault trees on a diet: automated reduction by graph rewriting. 651-703 - Ben C. Moszkowski, Dimitar P. Guelev:
An application of temporal projection to interleaving concurrency. 705-750 - Shuling Wang, Naijun Zhan, Lijun Zhang:
A Compositional Modelling and Verification Framework for Stochastic Hybrid Systems. 751-775
Volume 29, Number 5, September 2017
- Pavel Jancík, Jan Kofron:
On partial state matching. 777-803 - Daniel Gâinâ:
Birkhoff style calculi for hybrid logics. 805-832 - Wim H. Hesselink:
Tournaments for mutual exclusion: verification and concurrent complexity. 833-852 - Robert J. Colvin, Ian J. Hayes, Larissa A. Meinicke:
Designing a semantic model for a wide-spectrum language with concurrency. 853-875 - Rumyana Neykova, Laura Bocchi, Nobuko Yoshida:
Timed runtime monitoring for multiparty conversations. 877-910 - Peter Schrammel, Daniel Kroening, Martin Brain, Ruben Martins, Tino Teige, Tom Bienmüller:
Incremental bounded model checking for embedded software. 911-931
Volume 29, Number 6, November 2017
- Michael J.C. Gordon FRS Professor of Computer Assisted Reasoning (28 February 1948-22 August 2017). 933
- Graeme Smith, Kirsten Winter:
Relating trace refinement and linearizability. 935-950 - Hosein Nazarpour, Yliès Falcone, Saddek Bensalem, Marius Bozga:
Concurrency-preserving and sound monitoring of multi-threaded component-based systems: theory, algorithms, implementation, and evaluation. 951-986 - Mohamed Graiet, Lazhar Hamel, Amel Mammar, Samir Tata:
A verification and deployment approach for elastic component-based applications. 987-1011 - Ramiro Demasi, Pablo F. Castro, Thomas Stephen Edward Maibaum, Nazareno Aguirre:
Simulation relations for fault-tolerance. 1013-1050 - Behnaz Yousefi, Fatemeh Ghassemi, Ramtin Khosravi:
Modeling and efficient verification of wireless ad hoc networks. 1051-1086 - Sebastian Eggert, Ron van der Meyden:
Dynamic intransitive noninterference revisited. 1087-1120 - Cliff B. Jones:
The Turing Guide - By Jack Copeland, Jonathan Bowen, Mark Sprevak, Robin Wilson and others Oxford University Press, Oxford, UK, 26 January 2017, xv+576 pp, 246 × 189 mm, ISBN: 9780198747826 (Hardback, $75.00), ISBN: 9780198747833 (Paperback, $19.99). 1121-1122
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-26 18:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
