Stavros Aronis
Stavros Aronis
aronisstavatgmail.com

  Affiliation history
Bibliometrics: publication history
Average citations per article6.56
Citation Count59
Publication count9
Publication years2011-2017
Available for download6
Average downloads per article159.67
Downloads (cumulative)958
Downloads (12 Months)355
Downloads (6 Weeks)53
Student ACM Member
SEARCH
ROLE
Arrow RightAuthor only


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


9 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 9 of 9
Sort by:

1
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, ...

2 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

3 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

4 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

5
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 ...

6 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

7 published by ACM
September 2012 Erlang '12: Proceedings of the eleventh ACM SIGPLAN workshop on Erlang workshop
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 5,   Downloads (12 Months): 26,   Downloads (Overall): 176

Full text available: PDFPDF
Programming language implementers rely heavily on benchmarking for measuring and understanding performance of algorithms, architectural designs, and trade-offs between alternative implementations of compilers, runtime systems, and virtual machine components. Given this fact, it seems a bit ironic that it is often more difficult to come up with a good benchmark ...
Keywords: multicore, erlang, scalability, benchmarking

8
June 2012 TFP 2012: Proceedings of the 2012 Conference on Trends in Functional Programming - Volume 7829
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0

Erlang is a functional language that allows programmers to employ shared nothing processes and asynchronous message passing for parts of applications which can naturally execute concurrently. This paper reports on a non-trivial effort to use these concurrency features to parallelize a widely used application written in Erlang. More specifically, we ...

9 published by ACM
September 2011 Erlang '11: Proceedings of the 10th ACM SIGPLAN workshop on Erlang
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3,   Downloads (12 Months): 6,   Downloads (Overall): 102

Full text available: PDFPDF
Behaviours are one of the most widely used features of Erlang/OTP. They offer a convenient and well-tested abstraction layer for frequently employed design patterns in concurrent Erlang programming. In effect, they allow programmers to focus on the functional characteristics of their applications without having to resort to Erlang's concurrency-supporting primitives. ...
Keywords: abstract classes, erlang, behaviours



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