Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Timothy K. Zirkel

dblp:72/9117 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2Software engineering, systems software and programming languages · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
2 papers
Program verification · 46% Concurrent programming · 42% Program analysis · 12%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Concurrent programming
concurrency models
0.212015
CIVL: the concurrency intermediate verification language · SC 2015
Concurrent programming
concurrency verification
0.212015
CIVL: the concurrency intermediate verification language · SC 2015
Program verification › deductive verification
intermediate verification language
0.212015
CIVL: the concurrency intermediate verification language · SC 2015
Program verification › concurrent program verification
MPI program verification
0.112011
Automatic formal verification of MPI-based parallel programs · PPoPP 2011
Program verification › model checking
state space exploration
0.112011
Automatic formal verification of MPI-based parallel programs · PPoPP 2011
Program analysis
symbolic execution
0.112011
Automatic formal verification of MPI-based parallel programs · PPoPP 2011
Parallel and multicore computing
parallel programming models
0.112015
CIVL: the concurrency intermediate verification language · SC 2015

Methods — techniques the papers use, named apart from their topics

intermediate verification language · 0.4symbolic execution · 0.1explicit state space enumeration · 0.1
YearPublicationVenuePosition
2015 CIVL: the concurrency intermediate verification language
abstract
There are many ways to express parallel programs: message-passing libraries (MPI) and multithreading/GPU language extensions such as OpenMP, Pthreads, and CUDA, are but a few. This multitude creates a serious challenge for developers of software verification tools: it takes enormous effort to develop such tools, but each development effort typically targets one small part of the concurrency landscape, with little sharing of techniques and code among efforts.
Stephen F. Siegel, Manchun Zheng, Ziqing Luo, Timothy K. Zirkel, Andre V. Marianiello, John G. Edenhofner, Matthew B. Dwyer, Michael S. Rogers
SC4
2012 Loop Invariant Symbolic Execution for Parallel Programs
Stephen F. Siegel, Timothy K. Zirkel
VMCAI2
2011 Automatic formal verification of MPI-based parallel programs
abstract
The Toolkit for Accurate Scientific Software (TASS) is a suite of tools for the formal verification of MPI-based parallel programs used in computational science. TASS can verify various safety properties as well as compare two programs for functional equivalence. The TASS front end takes an integer n ≥ 1 and a C/MPI program, and constructs an abstract model of the program with n processes. Procedures, structs, (multi-dimensional) arrays, heap-allocated data, pointers, and pointer arithmetic are all representable in a TASS model. The model is then explored using symbolic execution and explicit state space enumeration. A number of techniques are used to reduce the time and memory consumed. A variety of realistic MPI programs have been verified with TASS, including Jacobi iteration and manager-worker type programs, and some subtle defects have been discovered. TASS is written in Java and is available from http://vsl.cis.udel.edu/tass under the Gnu Public License.
Stephen F. Siegel, Timothy K. Zirkel
PPoPP2
2011 Collective Assertions
Stephen F. Siegel, Timothy K. Zirkel
VMCAI2