132 Hits in 6.8 sec

Checking Correctness of Concurrent Objects: Tractable Reductions to Reachability (Invited Talk)

Ahmed Bouajjani, Michael Emmi, Constantin Enea, Jad Hamza, Marc Herbstritt
2015 Foundations of Software Technology and Theoretical Computer Science  
We address here the issue of investigating cases where tractable reductions of the observational refinement/linearizability problem to the reachability problem, or dually to invariant checking, are possible  ...  checking to check observational refinement, and (3) to establish decidability and complexity results for significant classes of concurrent objects and data structures.  ...  Keywords and phrases Concurrent objects, Linearizability, Verification, Bug detection Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2015.2 Category Invited Talk References 1 Parosh Aziz Abdulla, Frédéric  ... 
doi:10.4230/lipics.fsttcs.2015.2 dblp:conf/fsttcs/BouajjaniEEH15 fatcat:lz3vd7a4tjcpzh74jn532mvcdu

Workshop on Modelling of Objects, Components, and Agents, Aarhus, Denmark, August 27-28, 2001

Daniel Moldt
2000 DAIMI Report Series  
This booklet contains the proceedings of the workshop Modelling of Objects, Components, and Agents (MOCA'01), August 27-28, 2001.  ...  The workshop is organised by the CPN group at the Department of Computer Science, University of Aarhus, Denmark and the "Theoretical Foundations of Computer Science" Group at the University of Hamburg,  ...  Of course, we can have several external consumptions, firings and external productions concurrently, if there are enough tokens to allow the consumptions and firings.  ... 
doi:10.7146/dpb.v30i553.7110 fatcat:cfomvotlk5b23ath4h7grw5spq

Report on BCTCS & AlgoUK 2019

Matthew Johnson, Barnaby Martin, George B. Mertzios, Daniël Paulusma
2019 Bulletin of the European Association for Theoretical Computer Science  
Within BCTCS there were two invited talks, one on graph theory and perfect graphs and one on logic. Abstracts for all of the talks are provided below.  ...  Within AlgoUK there were four invited talks on Non-Standard Computing and four invited talks on Algorithmics.  ...  Researchers and PhD students wishing to contribute talks concerning any aspect of Theoretical Computer Science are cordially invited to do so.  ... 
dblp:journals/eatcs/JohnsonMMP19 fatcat:mzd35uzlerfzjntkhlxdxt4vem

Report on BCTCS 2013

Guy McCusker
2014 Bulletin of the European Association for Theoretical Computer Science  
Invited Talks at BCTCS 2013 Samson Abramsky, University of Oxford From Quantum Mechanics to Logic, Databases, Constraints, and Complexity Quantum Mechanics presents a disturbingly different picture of  ...  to be checked by hand.  ... 
dblp:journals/eatcs/McCusker14 fatcat:6mbueqohg5fxjk2advza4yktr4

Report on BCTCS 2012

Ian Pratt-Hartmann
2012 Bulletin of the European Association for Theoretical Computer Science  
Researchers and PhD students wishing to contribute talks concerning any aspect of Theoretical Computer Science are cordially invited to do so.  ...  The conference began with an invited talk by Mike Edmunds, of Cardiff University, entitled "The Antikythera Mechanism and the early history of mechanical computing."  ...  The objective is to minimize the makespan of the schedule.  ... 
dblp:journals/eatcs/Pratt-Hartmann12 fatcat:cgww3bkyazb6ncfzowolyhdkk4

Half a century after Carl Adam Petri's Ph.D. thesis: A perspective on the field

Manuel Silva
2013 Annual Reviews in Control  
This invited contribution aims to combine some historical facts with elements of a conceptual view on concurrent DEDS, giving pointers about the development of the field.  ...  In summary, multidisciplinary in themselves, formalisms belonging to the Petri nets paradigm may cover several phases of the life-cycle of complex DEDS.  ...  All of them started to work on Petri nets around 1973 -1975 , who started to work on stochastic Petri nets at the very beginning of the 1980s, and was initially inspired by contributions from UCLA.  ... 
doi:10.1016/j.arcontrol.2013.09.001 fatcat:othq33ivp5hdtpxqiwznkek6pe

A Practical Formal Model for Safety Analysis in Capability-Based Systems [chapter]

Fred Spiessens, Peter Van Roy
2005 Lecture Notes in Computer Science  
We introduce a subclass of these systems we call "saturated", that can provide safe and tractable approximations for the safety properties in arbitrary configurations of collaborating entities.  ...  Composite abstractions and patterns of arbitrary complexity are modeled as a configuration of communicating subjects.  ...  Region of Belgium under convention 114856.  ... 
doi:10.1007/11580850_14 fatcat:om4shotzp5fdnkfuoqi5xzt2u4

Epistemic Planning (Dagstuhl Seminar 17231)

Chitta Baral, Thomas Bolander, Hans Van Ditmarsch, Sheila McIlrath, Marc Herbstritt
2017 Dagstuhl Reports  
The original goals of the seminar were to develop benchmarks for epistemic planning, to explore the relationship between knowledge and belief in multi-agent epistemic planning, to develop models of agency  ...  topic of epistemic planning.  ...  information G with reachability objective Reach ω T .  ... 
doi:10.4230/dagrep.7.6.1 dblp:journals/dagstuhl-reports/BaralBDM17 fatcat:gpx3gj7f2jajzbximybwmjjjjm

Using formal specifications to support testing

Robert M. Hierons, Paul Krause, Gerald Lüttgen, Anthony J. H. Simons, Sergiy Vilkomir, Martin R. Woodward, Hussein Zedan, Kirill Bogdanov, Jonathan P. Bowen, Rance Cleaveland, John Derrick, Jeremy Dick (+3 others)
2009 ACM Computing Surveys  
the following schema: This declares items to be a sequence of elements from the set Object such that the length of items does not exceed maxSize.  ...  This defines a set, Object, and at this level of abstraction we are not concerned with the structure of the elements of this set.  ...  We would like to thank the members of the FORTEST network for the many useful discussions and presentations that have informed the ideas presented in this paper.  ... 
doi:10.1145/1459352.1459354 fatcat:423uyowpgjaxljjli2u47rcpay

SLAM and Static Driver Verifier: Technology Transfer of Formal Methods inside Microsoft [chapter]

Thomas Ball, Byron Cook, Vladimir Levin, Sriram K. Rajamani
2004 Lecture Notes in Computer Science  
Its goal was to automatically check that a C program correctly uses the interface to an external library.  ...  The project used and extended ideas from symbolic model checking, program analysis and theorem proving in novel ways to address this problem.  ...  We wish to thank everyone mentioned in this paper for their efforts on the SLAM and SDV projects, and to the many unnamed researchers and developers whose work we built on.  ... 
doi:10.1007/978-3-540-24756-2_1 fatcat:ikolwljjobgxhbxfaj7w4is5pu

RacerD: compositional static race detection

Sam Blackshear, Nikos Gorogiannis, Peter W. O'Hearn, Ilya Sergey
2018 Proceedings of the ACM on Programming Languages (PACMPL)  
The tool suite by Coverity also includes a proprietary data race detector which, according to invited POPL talk by Chou (2014) , uses global statistical data.  ...  due to (since corrected) implementation errors on our part.  ... 
doi:10.1145/3276514 fatcat:ksafi3642rcapg74r2gaa54ify

Formal Methods for Quantum Programs: A Survey [article]

Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, Zhaowei Xu
2022 arXiv   pre-print
As an alternative strategy, formal methods are prone to play a decisive role in the emerging field of quantum software.  ...  Moreover, importing the testing and debugging practices at use in classical programming is extremely difficult in the quantum case, due to the destructive aspect of quantum measurement.  ...  Acknowledgments This work was supported in part by the French National Research Agency (ANR) under the research project SoftQPRO ANR-17-CE25-0009-02, by the DGE of the French Ministry of Industry under  ... 
arXiv:2109.06493v2 fatcat:opwbcmo6ozcmdgi6jml4xxfb6i

Categorical Models for a Semantically Linear Lambda-calculus

Marco Gaboardi, Mauro Piccolo
2010 Electronic Proceedings in Theoretical Computer Science  
In particular, in this work, we introduce the notion of Sll-Category, which is able to describe a very large class of sound models of Sll-calculus.  ...  Sll-Category extends in the natural way Benton, Bierman, Hyland and de Paiva's Linear Category, in order to soundly interpret all the constructs of Sll-calculus.  ...  In addition, the programme includes invited talks by Alex Simpson (Edinburgh), Simona Ronchi Della Rocca, (Torino) and Simone Martini (Bologna).  ... 
doi:10.4204/eptcs.22.1 fatcat:kbeaid46cnasnj7wceoouoaauu

Formal Verification of Object-Oriented Software. Papers presented at the 2nd International Conference, October 5-7, 2011, Turin, Italy

Bernhard [Hrsg.] Beckert, Ferruccio [Hrsg.] Damiani, Dilian [Hrsg.] Gurov
We plan to extend the analysis to non-integer inputs/outputs by investigating mappings into the integer domain. We would like to investigate the role of specifications in more detail.  ...  We are very grateful to the anonymous reviewers for their comments on an earlier version of this paper.  ...  The concurrent object level is used to capture concurrent control flow and communication in ABS models; the concurrency model of the Core ABS is based on the concept of Concurrent Object Groups.  ... 
doi:10.5445/ir/1000024780 fatcat:qnqnk6c46jcrxjgydp6migtxpm

An industrial view of electronic design automation

D. MacMillen, R. Camposano, D. Hill, T.W. Williams
2000 IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  
We discuss the kinds of tool sets needed to support design in this environment.  ...  The automation of the design of electronic systems and circuits [electronic design automation (EDA)] has a history of strong innovation.  ...  Model Checkers A model checker checks conditions expressed in temporal logic, called properties, against the set of reachable states in a logic design, to prove the properties to be true.  ... 
doi:10.1109/43.898825 fatcat:hhk7zrepyfcyxgizvotqck7cei
« Previous Showing results 1 — 15 out of 132 results