Author image not provided
 Konstantinos Sagonas

 homepage
 kostisatit.uu.se

  Affiliation history
Bibliometrics: publication history
Average citations per article7.38
Citation Count657
Publication count89
Publication years1994-2017
Available for download49
Average downloads per article236.31
Downloads (cumulative)11,579
Downloads (12 Months)1,038
Downloads (6 Weeks)154
Professional ACM Member
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


90 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 90
Result page: 1 2 3 4 5

Sort by:

1 published by ACM
December 2017 Proceedings of the ACM on Programming Languages: Volume 2 Issue POPL, January 2018
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 37,   Downloads (12 Months): 37,   Downloads (Overall): 37

Full text available: PDFPDF
We present a stateless model checking algorithm for verifying concurrent programs running under RC11, a repaired version of the C/C++11 memory model without dependency cycles. Unlike most previous approaches, which enumerate thread interleavings up to some partial order reduction improvements, our approach works directly on execution graphs and (in the ...
Keywords: weak memory models, C/C++11, software model checking, RC11

2
December 2017 Acta Informatica: Volume 54 Issue 8, December 2017
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces. Chronological traces induce a partial order relation on relaxed memory executions, ...

3 published by ACM
September 2017 Erlang 2017: Proceedings of the 16th ACM SIGPLAN International Workshop on Erlang
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 21,   Downloads (12 Months): 21,   Downloads (Overall): 21

Full text available: PDFPDF
Erlang is a concurrent functional language based on the actor model of concurrency. In the purest form of this model, actors are realized by processes that do not share memory and communicate with each other exclusively via message passing. Erlang comes quite close to this model, as message passing is ...
Keywords: Scheduling non-determinism, Actors, BEAM, Concuerror, Erlang

4 published by ACM
August 2017 Journal of the ACM (JACM): Volume 64 Issue 4, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 20,   Downloads (12 Months): 112,   Downloads (Overall): 112

Full text available: PDFPDF
Stateless model checking is a powerful method for program verification that, however, suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR), an algorithm originally introduced by Flanagan and Godefroid in ...
Keywords: wakeup trees, Dynamic partial order reduction, concurrency, software model checking, source sets, systematic testing

5 published by ACM
August 2017 ACM Transactions on Programming Languages and Systems (TOPLAS): Volume 39 Issue 4, September 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 14,   Downloads (12 Months): 102,   Downloads (Overall): 102

Full text available: PDFPDF
Distributed actor languages are an effective means of constructing scalable reliable systems, and the Erlang programming language has a well-established and influential model. While the Erlang model conceptually provides reliable scalability, it has some inherent scalability limits and these force developers to depart from the model at scale. This article ...
Keywords: scalability, Erlang, reliability

6 published by ACM
July 2017 SPIN 2017: Proceedings of the 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 3,   Downloads (12 Months): 66,   Downloads (Overall): 66

Full text available: PDFPDF
Read-Copy-Update (RCU) is a synchronization mechanism used heavily in key components of the Linux kernel, such as the virtual filesystem (VFS), to achieve scalability by exploiting RCU's ability to allow concurrent reads and updates. RCU's design is non-trivial, requires significant effort to fully understand it, let alone become convinced that ...
Keywords: Nidhugg, Linux kernel, Read-Copy-Update, Software model checking

7 published by ACM
July 2017 ISSTA 2017: Proceedings of the 26th ACM SIGSOFT International Symposium on Software Testing and Analysis
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 18,   Downloads (12 Months): 88,   Downloads (Overall): 88

Full text available: PDFPDF
We introduce targeted property-based testing, an enhanced form of property-based testing that aims to make the input generation component of a property-based testing tool guided by a search strategy rather than being completely random. Thus, this testing technique combines the advantages of both search-based and property-based testing. We demonstrate the ...
Keywords: PropEr, Property-based testing, QuickCheck, Search-based testing

8 published by ACM
September 2016 Erlang 2016: Proceedings of the 15th International Workshop on Erlang
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 33,   Downloads (Overall): 65

Full text available: PDFPDF
Often Erlang programmers want or need to use existing C libraries. Also, occasionally they have good reasons to implement parts of their applications directly in C. To cater for such situations, the Erlang/OTP system comes with various mechanisms to call C from Erlang. The most modern of them allows to ...
Keywords: foreign language interface, language interoperability

9
October 2015 LCN WORKSHOPS '15: Proceedings of the 2015 IEEE 40th Local Computer Networks Conference Workshops (LCN Workshops)
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

Sensor network macroprogramming methodologies such as the Abstract Task Graph hold the promise of enabling high-level sensor network application development. However, progress in this area is hampered by the scarcity of tools, and also because of insufficient focus on developing tool support for programming applications aware of performance requirements.

10
September 2015 LCPC 2015: Revised Selected Papers of the 28th International Workshop on Languages and Compilers for Parallel Computing - Volume 9519
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

We extend contention adapting trees CA trees, a family of concurrent data structures for ordered sets, to support linearizable range queries, range updates, and operations that atomically operate on multiple keys such as bulk insertions and deletions. CA trees differ from related concurrent data structures by adapting themselves according to ...

11 published by ACM
July 2015 PPDP '15: Proceedings of the 17th International Symposium on Principles and Practice of Declarative Programming
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 26,   Downloads (Overall): 77

Full text available: PDFPDF
Concolic testing is a software testing technique combining concrete execution of a program (given specific input, along specific paths) with symbolic execution (generating new test inputs that give better path coverage than random test case generation). Concolic testing has so far been applied, mainly at the level of bytecode or ...

12
June 2015 ISPDC '15: Proceedings of the 2015 14th International Symposium on Parallel and Distributed Computing
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 1

With multicourse being ubiquitous, concurrent data structures are becoming increasingly important. This paper proposes a novel approach to concurrent data structure design where the data structure collects statistics about contention and adapts dynamically according to this statistics. We use this approach to create a contention adapting binary search tree (CA ...
Keywords: concurrent data structures, search trees, multicore

13 published by ACM
June 2015 HPDC '15: Proceedings of the 24th International Symposium on High-Performance Parallel and Distributed Computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 56,   Downloads (Overall): 230

Full text available: PDFPDF
A coherent global address space in a distributed system enables shared memory programming in a much larger scale than a single multicore or a single SMP. Without dedicated hardware support at this scale, the solution is a software distributed shared memory (DSM) system. However, traditional approaches to coherence ( centralized ...

14
June 2015 DCOSS '15: Proceedings of the 2015 International Conference on Distributed Computing in Sensor Systems
Publisher: IEEE Computer Society
Bibliometrics:
Citation Count: 0

Task Graph (ATaG) is a sensor network application development paradigm where the application is visually described by a graph where the nodes correspond to application-level tasks and edges correspond to data flows. We extend ATaG with the option to add non-functional requirements: constraints on end-to-end delay and packet delivery rate. ...

15
April 2015 Proceedings of the 21st International Conference on Tools and Algorithms for the Construction and Analysis of Systems - Volume 9035
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 3

We present a technique for efficient stateless model checking of programs that execute under the relaxed memory models TSO and PSO. The basis for our technique is a novel representation of executions under TSO and PSO, called chronological traces . Chronological traces induce a partial order relation on relaxed memory ...

16 published by ACM
September 2014 Erlang '14: Proceedings of the Thirteenth ACM SIGPLAN workshop on Erlang
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 8,   Downloads (Overall): 48

Full text available: PDFPDF
The Erlang Term Storage (ETS) is a key component of the runtime system and standard library of Erlang/OTP. In particular, on big multicores, the performance of many applications that use ETS as a shared key-value store heavily depends on the scalability of ETS. In this work, we investigate an alternative ...
Keywords: erlang, search trees, concurrent data structures

17 published by ACM
June 2014 SPAA '14: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 2,   Downloads (12 Months): 28,   Downloads (Overall): 111

Full text available: PDFPDF
The scalability of parallel programs is often bounded by the performance of synchronization mechanisms used to protect critical sections. The performance of these mechanisms is in turn determined by their ability to use modern hardware efficiently and do useful work while or instead of waiting. This brief announcement sketches the ...
Keywords: multi-core, numa, synchronization, locking

18
February 2014 Science of Computer Programming: Volume 80, February, 2014
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We present the design of a formal low-level multithreaded language with advanced region-based memory management and thread synchronization primitives, where well-typed programs are memory safe and race free. In our language, regions and locks are combined in a single hierarchy and are subject to uniform ownership constraints imposed by this ...
Keywords: Type and effect systems, Region-based memory management, Cyclone, Safe multithreading

19
February 2014 Science of Computer Programming: Volume 80 Issue PB, February 2014
Publisher: Elsevier North-Holland, Inc.
Bibliometrics:
Citation Count: 0

We present the design of a formal low-level multithreaded language with advanced region-based memory management and thread synchronization primitives, where well-typed programs are memory safe and race free. In our language, regions and locks are combined in a single hierarchy and are subject to uniform ownership constraints imposed by this ...
Keywords: Cyclone, Safe multithreading, Type and effect systems, Region-based memory management

20 published by ACM
January 2014 POPL '14: Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Publisher: ACM
Bibliometrics:
Citation Count: 25
Downloads (6 Weeks): 4,   Downloads (12 Months): 80,   Downloads (Overall): 387

Full text available: PDFPDF
Stateless model checking is a powerful technique for program verification, which however suffers from an exponential growth in the number of explored executions. A successful technique for reducing this number, while still maintaining complete coverage, is Dynamic Partial Order Reduction (DPOR). We present a new DPOR algorithm, which is the ...
Keywords: dynamic partial oder reduction, wakeup trees, concurrency, software model checking, source sets, systematic testing
Also published in:
January 2014  ACM SIGPLAN Notices - POPL '14: Volume 49 Issue 1, January 2014



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2018 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us