2008 |
33 | EE | Anindya Banerjee,
Michael Barnett,
David A. Naumann:
Boogie Meets Regions: A Verification Experience Report.
VSTTE 2008: 177-191 |
2007 |
32 | EE | Jonathan Aldrich,
Michael Barnett,
Dimitra Giannakopoulou,
Gary T. Leavens,
Natasha Sharygina:
Specification and verification of component-based systems 2007.
ESEC/SIGSOFT FSE 2007: 609-610 |
31 | EE | Jonathan Aldrich,
Gary T. Leavens,
Michael Barnett,
Natasha Sharygina,
Dimitra Giannakopoulou:
Specification and verification of component-based systems 2007.
ESEC/SIGSOFT FSE (Companion) 2007: 609-610 |
2006 |
30 | EE | Michael Barnett,
David A. Naumann,
Wolfram Schulte,
Qi Sun:
Allowing State Changes in Specifications.
ETRICS 2006: 321-336 |
29 | EE | David A. Naumann,
Michael Barnett:
Towards imperative modules: Reasoning about invariants and sharing of mutable state.
Theor. Comput. Sci. 365(1-2): 143-168 (2006) |
2005 |
28 | EE | Michael Barnett,
Bor-Yuh Evan Chang,
Robert DeLine,
Bart Jacobs,
K. Rustan M. Leino:
Boogie: A Modular Reusable Verifier for Object-Oriented Programs.
FMCO 2005: 364-387 |
27 | EE | Michael Barnett,
K. Rustan M. Leino:
Weakest-precondition of unstructured programs.
PASTE 2005: 82-87 |
26 | EE | Michael Barnett,
Robert DeLine,
Manuel Fähndrich,
Bart Jacobs,
K. Rustan M. Leino,
Wolfram Schulte,
Herman Venter:
The Spec# Programming System: Challenges and Directions.
VSTTE 2005: 144-152 |
2004 |
25 | | Jim Davies,
Wolfram Schulte,
Michael Barnett:
Formal Methods and Software Engineering, 6th International Conference on Formal Engineering Methods, ICFEM 2004, Seattle, WA, USA, November 8-12, 2004, Proceedings
Springer 2004 |
24 | EE | David A. Naumann,
Michael Barnett:
Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State.
LICS 2004: 313-323 |
23 | EE | Michael Barnett,
David A. Naumann:
Friends Need a Bit More: Maintaining Invariants Over Shared State.
MPC 2004: 54-84 |
22 | EE | Michael Barnett,
Robert DeLine,
Manuel Fähndrich,
K. Rustan M. Leino,
Wolfram Schulte:
Verification of Object-Oriented Programs with Invariants.
Journal of Object Technology 3(6): 27-56 (2004) |
2003 |
21 | EE | Michael Barnett,
Wolfram Schulte,
Nikolai Tillmann:
Using AsmL for Runtime Verification.
Abstract State Machines 2003: 407 |
20 | EE | Michael Barnett,
Wolfgang Grieskamp,
Lev Nachmanson,
Wolfram Schulte,
Nikolai Tillmann,
Margus Veanes:
Towards a Tool Environment for Model-Based Testing with AsmL.
FATES 2003: 252-266 |
19 | EE | Michael Barnett,
Wolfgang Grieskamp,
Wolfram Schulte,
Nikolai Tillmann,
Margus Veanes:
Validating Use-Cases with the AsmL Test Tool.
QSIC 2003: 238-246 |
18 | EE | Michael Barnett,
Wolfram Schulte:
Runtime verification of .NET contracts.
Journal of Systems and Software 65(3): 199-208 (2003) |
2001 |
17 | | Michael Barnett,
Wolfram Schulte:
The ABCs of specification: asml, behavior, and components.
Informatica (Slovenia) 25(4): (2001) |
2000 |
16 | EE | Michael Barnett,
Egon Börger,
Yuri Gurevich,
Wolfram Schulte,
Margus Veanes:
Using Abstract State Machines at Microsoft: A Case Study.
Abstract State Machines 2000: 367-379 |
15 | EE | Michael Barnett,
Charles J. Miller:
Analysis of the virtual enterprise using distributed supply chain modeling and simulation: an application of e-SCOR.
Winter Simulation Conference 2000: 352-355 |
1996 |
14 | | Michael Barnett,
David G. Payne,
Robert A. van de Geijn,
Jerrell Watts:
Broadcasting on Meshes with Wormhole Routing.
J. Parallel Distrib. Comput. 35(2): 111-122 (1996) |
1995 |
13 | | Michael Barnett,
Richard J. Littlefield,
David G. Payne,
Robert A. van de Geijn:
Global Combine Algorithms for 2-D Meshes with Wormhole Routing.
J. Parallel Distrib. Comput. 24(2): 191-201 (1995) |
1994 |
12 | | Stefan Tritscher,
Roman Zajcew,
Michael Barnett:
Load Leveling on the Paragon Multicomputer.
HPCN 1994: 330-337 |
11 | EE | Michael Barnett,
Lance Shuler,
Satya Gupta,
David G. Payne,
Robert A. van de Geijn,
Jerrell Watts:
Building a high-performance collective communication library.
SC 1994: 107-116 |
1993 |
10 | | Michael Barnett,
Christian Lengauer:
A Systolizing Compilation Scheme for Nested Loops with Linear Bounds.
Functional Programming, Concurrency, Simulation and Automated Reasoning 1993: 374-398 |
9 | | Michael Barnett,
Richard J. Littlefield,
David G. Payne,
Robert A. van de Geijn:
Global Combine on Mesh Architectures with Wormhole Routing.
IPPS 1993: 156-162 |
8 | | Michael Barnett,
Richard J. Littlefield,
David G. Payne,
Robert A. van de Geijn:
Efficient Communication Primitives on Mesh Architectures with Hardware Routing.
PPSC 1993: 943-948 |
7 | | Roman Zajcew,
Paul Roy,
David L. Black,
Chris Peak,
Paulo Guedes,
Bradford Kemp,
John LoVerso,
Michael Leibensperger,
Michael Barnett,
Faramarz Rabii,
Durriya Netterwala:
An OSF/1 UNIX for Massively Parallel Multicomputers.
USENIX Winter 1993: 449-468 |
1992 |
6 | | Michael Barnett,
Christian Lengauer:
Unimodularity Considered Non-Essential.
CONPAR 1992: 659-664 |
5 | | Michael Barnett,
Christian Lengauer:
Unimodularity and the Prallelization of Loops.
Parallel Processing Letters 2: 273-281 (1992) |
1991 |
4 | | Michael Barnett,
Christian Lengauer:
A Systolizing Compilation Scheme: Abstract.
ICPP (2) 1991: 296-297 |
3 | | Michael Barnett,
Christian Lengauer:
The Synthesis of Systolic Programs.
Research Directions in High-Level Parallel Programming Languages 1991: 309-325 |
2 | | Christian Lengauer,
Michael Barnett,
Duncan G. Hudson III:
Towards Systolizing Compilation.
Distributed Computing 5: 7-24 (1991) |
1990 |
1 | EE | Michael Barnett:
The formal derivation of distributed programs from systolic arrays.
SPDP 1990: 363-366 |