Travelled to:
1 × Australia
1 × Austria
1 × Canada
1 × China
1 × Denmark
1 × Germany
1 × Spain
3 × France
3 × Italy
3 × Portugal
3 × The Netherlands
3 × United Kingdom
8 × USA
Collaborated with:
C.Palamidessi M.Gabbrielli ∅ M.M.Bonsangue S.d.Gouw W.P.d.Roever F.Arbab E.B.Johnsen J.Rot J.J.M.M.Rutten D.Clarke M.C.Meo U.Hannemann P.Y.H.Wong R.M.v.Eijk M.v.Hulst W.Ahrendt I.Grabe L.Astefanoaei M.B.v.Riemsdijk C.Pierik J.W.Klop J.G.Scholten A.Stam L.W.N.v.d.Torre B.Nobakht M.M.Jaghoori R.Schlatte C.Baier E.Ábrahám-Mumm M.Steffen E.Marchiori J.N.Kok R.Bubel R.Hähnle D.Ancona J.Jacob N.Bezirgiannis K.I.Pun S.L.T.Tarifa H.Jonkers R.v.Buuren H.Bosma H.W.L.t.Doest L.Groenewegen S.Hoppenbrouwers M.Iacob W.Janssen M.M.Lankhorst D.v.Leeuwen E.Proper G.V.v.Zanten
Talks about:
program (11) concurr (9) constraint (7) time (7) object (6) logic (6) process (4) system (4) asynchron (3) creation (3)
Person: Frank S. de Boer
DBLP: Boer:Frank_S=_de
Contributed to:
Wrote 35 papers:
- CAV-2015-GouwRBBH #java
- OpenJDK’s Java.utils.Collection.sort() Is Broken: The Good, the Bad and the Worst Case (SdG, JR, FSdB, RB, RH), pp. 273–289.
- ICALP-v2-2014-BonsangueRABR #algebra #induction
- A Coalgebraic Foundation for Coinductive Union Types (MMB, JR, DA, FSdB, JJMMR), pp. 62–73.
- SFM-2014-BoerG #monitoring #runtime
- Combining Monitoring with Run-Time Assertion Checking (FSdB, SdG), pp. 217–262.
- SAC-2013-GouwBJW #case study #industrial #java #runtime #source code
- Run-time checking of data- and protocol-oriented properties of Java programs: an industrial case study (SdG, FSdB, EBJ, PYHW), pp. 1573–1578.
- SEFM-2013-BoerGW #runtime #verification
- Run-Time Verification of Coboxes (FSdB, SdG, PYHW), pp. 259–273.
- IJCAR-2012-BoerBR #automation #pointer #recursion #source code #verification
- Automated Verification of Recursive Programs with Pointers (FSdB, MMB, JR), pp. 149–163.
- SAC-2012-NobakhtBJS #deployment #programming #scheduling
- Programming and deployment of active objects with application-level scheduling (BN, FSdB, MMJ, RS), pp. 1883–1888.
- FM-2009-AhrendtBG #logic
- Abstract Object Creation in Dynamic Logic (WA, FSdB, IG), pp. 612–627.
- LOPSTR-2009-AstefanoaeiBR #testing #using
- Using Rewrite Strategies for Testing BUpL Agents (LA, FSdB, MBvR), pp. 143–157.
- ESOP-2007-BoerCJ
- A Complete Guide to the Future (FSdB, DC, EBJ), pp. 316–330.
- FM-2005-PierikCB #using
- Controlling Object Allocation Using Creation Guards (CP, DC, FSdB), pp. 59–74.
- SAC-2005-Guillen-ScholtenABB #calculus #coordination #mobile
- MoCha-pi, an exogenous coordination calculus based on mobile channels (JGS, FA, FSdB, MMB), pp. 436–442.
- EDOC-2004-BoerBJST #architecture #logic
- A Logical Viewpoint on Architectures (FSdB, MMB, JJ, AS, LWNvdT), pp. 73–83.
- SEFM-2004-ArbabBBR #component #logic #modelling
- Models and Temporal Logics for Timed Component Connectors (FA, CB, FSdB, JJMMR), pp. 198–207.
- EDOC-2003-JonkersBABBBDGSHIJLLPSTZ #architecture #enterprise #towards
- Towards a Language for Coherent Enterprise Architecture Descriptions (HJ, RvB, FA, FSdB, MMB, HB, HWLtD, LG, JGS, SH, MEI, WJ, MML, DvL, EP, AS, LWNvdT, GVvZ), pp. 28–39.
- FoSSaCS-2002-Abraham-MummBRS #concept #java #multi #thread #verification
- Verification for Java’s Reentrant Multithreading Concept (EÁM, FSdB, WPdR, MS), pp. 5–20.
- FoSSaCS-2002-BoerGM #concurrent #constraints #correctness #proving #source code
- Proving Correctness of Timed Concurrent Constraint Programs (FSdB, MG, MCM), pp. 37–51.
- CSL-2001-BoerE #decidability #logic #navigation
- Decidable Navigation Logics for Object Structures (FSdB, RMvE), pp. 324–338.
- PPDP-2001-BoerGM #semantics
- A Denotational Semantics for Timed Linda (FSdB, MG, MCM), pp. 28–36.
- SAC-2000-ArbabBB #component #coordination #mobile
- A Coordination Lanuage for Mobile Components (FA, MMB, FSdB), pp. 166–173.
- FM-v2-1999-BoerHR #approach #concurrent #paradigm #semantics
- Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach (FSdB, UH, WPdR), pp. 1245–1265.
- FoSSaCS-1999-Boer #calculus #object-oriented
- A WP-calculus for OO (FSdB), pp. 135–149.
- FME-1997-BoerHR #composition #concurrent #proving
- A Compositional Proof System for Shared Variable Concurrency (FSdB, UH, WPdR), pp. 515–532.
- FME-1996-BoerH #communication #nondeterminism #process
- Local Nondeterminism in Asynchronously Communicating Processes (FSdB, MvH), pp. 367–384.
- SAS-1996-BoerGP #constraints #correctness #logic programming #proving #scheduling #source code
- Proving Correctness of Constraint Logic Programs with Dynamic Scheduling (FSdB, MG, CP), pp. 83–97.
- ILPS-1995-BoerG #concurrent #constraints #modelling #programming #realtime
- Modelling Real-Time in Concurrent Constraint Programming (FSdB, MG), pp. 528–542.
- POPL-1994-BoerGMP #concurrent #constraints #proving #source code
- Proving Concurrent Constraint Programs Correct (FSdB, MG, EM, CP), pp. 98–108.
- ILPS-1993-BoerKPR #concurrent #constraints #programming
- Non-monotonic Concurrent Constraint Programming (FSdB, JNK, CP, JJMMR), pp. 315–334.
- JICSLP-1992-BoerP #algebra #concurrent #constraints #process #programming
- A Process Algebra of Concurrent Constraint Programming (FSdB, CP), pp. 463–477.
- LICS-1992-BoerKP #algebra #communication #process
- Asynchronous Communication in Process Algebra (FSdB, JWK, CP), pp. 137–147.
- LICS-1991-Boer #composition #process #proving
- A Compositional Proof System for Dynamic Process Creation (FSdB), pp. 399–405.
- ICALP-1990-Boer #object-oriented #parallel #proving
- A Proof System for the Parallel Object-Oriented Language POOL (FSdB), pp. 572–585.
- NACLP-1990-BoerP #comparison #concurrent #logic programming
- Concurrent Logic Programming: Asynchronism and Language Comparison (FSdB, CP), pp. 175–194.
- CAAP-1991-BoerP #concurrent #constraints #programming
- A Fully Abstract Model for Concurrent Constraint Programming (FSdB, CP), pp. 296–319.
- FASE-2019-BezirgiannisBJP #case study #implementation #manycore #memory management
- Implementing SOS with Active Objects: A Case Study of a Multicore Memory System (NB, FSdB, EBJ, KIP, SLTT), pp. 332–350.