148 search results - page 12 / 30 » Semantic issues in the design of languages for debugging |
BIRTHDAY
1991
Springer
13 years 11 months ago
1991
Springer
First-order modal logics, as traditionally formulated, are not expressive enough. It is this that is behind the difficulties in formulating a good analog of Herbrand’s Theorem, ...
PLDI
2005
ACM
14 years 1 months ago
2005
ACM
We introduce a language and system that supports definition and composition of complex run-time security policies for Java applications. Our policies are comprised of two sorts o...
DASFAA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract. In this paper, we present a FASST mining approach to extract the frequently changing semantic structures (FASSTs), which are a subset of semantic substructures that chang...
AOSD
2010
ACM
13 years 8 months ago
2010
ACM
Embedded domain-specific languages (EDSLs) are said to be easier to compose than DSLs that are implemented by preprocessors. However, existing approaches focus on composition scen...
PLDI
2010
ACM
13 years 10 months ago
2010
ACM
The most intuitive memory model for shared-memory multithreaded programming is sequential consistency (SC), but it disallows the use of many compiler and hardware optimizations th...