Daiva Naudziuniene

dblp:24/10082 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 3 · 1 first-authorArtificial intelligence and machine learning · 1Theory of computation · 1

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
3 papers
Program verification · 56% Programming languages and type systems · 39% Compilers and program optimization · 5%
Human-computer interaction and pervasive computing
1 paper
User interface design and tools · 100%

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

TopicWeightPapersLastEvidence papers
Program verification › program logic
separation logic
0.522018
JaVerT: JavaScript verification toolchain · Proc. ACM Program. Lang. 2018
jStar-eclipse: an IDE for automated verification of Java programs · SIGSOFT FSE 2011
Program verification › mechanized verification
semi-automated verification
0.312018
JaVerT: JavaScript verification toolchain · Proc. ACM Program. Lang. 2018
Programming languages and type systems › dynamic languages
javascript
0.212014
A trusted mechanised JavaScript specification · POPL 2014
Programming languages and type systems
language design
0.212014
A trusted mechanised JavaScript specification · POPL 2014
Programming languages and type systems
language semantics
0.212014
A trusted mechanised JavaScript specification · POPL 2014
Programming languages and type systems › language semantics › formal semantics
mechanized semantics
0.212014
A trusted mechanised JavaScript specification · POPL 2014
Program verification
automated verification
0.112011
jStar-eclipse: an IDE for automated verification of Java programs · SIGSOFT FSE 2011
Program verification › code-level verification
java verification
0.112011
jStar-eclipse: an IDE for automated verification of Java programs · SIGSOFT FSE 2011
Compilers and program optimization
compiler correctness
0.112018
JaVerT: JavaScript verification toolchain · Proc. ACM Program. Lang. 2018
User interface design and tools › programming environments
integrated development environment
0.012011
jStar-eclipse: an IDE for automated verification of Java programs · SIGSOFT FSE 2011

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

separation logic · 0.6axiomatic specification · 0.3mechanised specification · 0.2
YearPublicationVenuePosition
2018 JaVerT: JavaScript verification toolchain
abstract
The dynamic nature of JavaScript and its complex semantics make it a difficult target for logic-based verification. We introduce JaVerT, a semi-automatic JavaScript Verification Toolchain, based on separation logic and aimed at the specialist developer wanting rich, mechanically verified specifications of critical JavaScript code. To specify JavaScript programs, we design abstractions that capture its key heap structures (for example, prototype chains and function closures), allowing the developer to write clear and succinct specifications with minimal knowledge of the JavaScript internals. To verify JavaScript programs, we develop JaVerT, a verification pipeline consisting of: JS-2-JSIL, a well-tested compiler from JavaScript to JSIL, an intermediate goto language capturing the fundamental dynamic features of JavaScript; JSIL Verify, a semi-automatic verification tool based on a sound JSIL separation logic; and verified axiomatic specifications of the JavaScript internal functions. Using JaVerT, we verify functional correctness properties of: data-structure libraries (key-value map, priority queue) written in an object-oriented style; operations on data structures such as binary search trees (BSTs) and lists; examples illustrating function closures; and test cases from the official ECMAScript test suite. The verification times suggest that reasoning about larger, more complex code using JaVerT is feasible.
José Fragoso Santos, Petar Maksimovic 0001, Daiva Naudziuniene, Thomas Wood 0001, Philippa Gardner
Proc. ACM Program. Lang.3
2017 Towards Logic-Based Verification of JavaScript Programs
José Fragoso Santos, Philippa Gardner, Petar Maksimovic 0001, Daiva Naudziuniene
CADE4
2014 A trusted mechanised JavaScript specification
abstract
JavaScript is the most widely used web language for client-side applications. Whilst the development of JavaScript was initially just led by implementation, there is now increasing momentum behind the ECMA standardisation process. The time is ripe for a formal, mechanised specification of JavaScript, to clarify ambiguities in the ECMA standards, to serve as a trusted reference for high-level language compilation and JavaScript implementations, and to provide a platform for high-assurance proofs of language properties.
Martin Bodin, Arthur Charguéraud, Daniele Filaretti, Philippa Gardner, Sergio Maffeis, Daiva Naudziuniene, Alan Schmitt, Gareth Smith
POPL6
2011 jStar-eclipse: an IDE for automated verification of Java programs
abstract
jStar is a tool for automatically verifying Java programs. It uses separation logic to support abstract reasoning about object specifications. jStar can verify a number of challenging design patterns, including Subject/Observer, Visitor, Factory and Pooling. However, to use jStar one has to deal with a family of command-line tools that expect specifications in separate files and diagnose the errors by inspecting the text output from these tools.
Daiva Naudziuniene, Matko Botincan, Dino Distefano, Mike Dodds, Radu Grigore, Matthew J. Parkinson
SIGSOFT FSE1