![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Computer Languages, Systems & Structures, Volume 39
Volume 39, Number 1, April 2013
- Wenchao Zhou, Tao Tao, Boon Thau Loo
, Yun Mao:
Declarative secure distributed information systems. 1-24 - Florian Brandner
, Quentin Colombet:
Elimination of parallel copies using code motion on data dependence graphs. 25-47
Volume 39, Number 2, July 2013
- Lennart Beringer, Robert Grabowski, Martin Hofmann:
Verifying pointer and string analyses with region type systems. 49-65
Volume 39, Number 3, October 2013
- Herbert Prähofer, Roland Schatz, Christian Wirth, Dominik Hurnaus, Hanspeter Mössenböck
:
Monaco - A domain-specific language solution for reactive process control programming with hierarchical components. 67-94 - Dandan Gong, Tiantian Wang, Xiaohong Su, Peijun Ma:
A test-suite reduction approach to improving fault-localization effectiveness. 95-108 - Sepehr Amir-Mohammadian, Mehran S. Fallah:
Noninterference in a predicative polymorphic calculus for access control. 109-120
Volume 39, Number 4, December 2013
- Marjan Mernik, Barrett R. Bryant:
Special issue on the Programming Languages track at the 27th ACM Symposium on Applied Computing. 121-122 - Christian Häubl, Christian Wimmer, Hanspeter Mössenböck
:
Context-sensitive trace inlining for Java. 123-141 - Davide Ancona:
Regular corecursion in Prolog. 142-162 - David Haraburda, Paul Tarau:
Binary trees as a computational framework. 163-181
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.