Titlebook: Mathematics of Program Construction; 11th International C Jeremy Gibbons,Pablo Nogueira Conference proceedings 2012 Springer-Verlag Berlin

IU421

書目名稱Mathematics of Program Construction影響因子(影響力)




書目名稱Mathematics of Program Construction影響因子(影響力)學(xué)科排名




書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度




書目名稱Mathematics of Program Construction網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Mathematics of Program Construction被引頻次




書目名稱Mathematics of Program Construction被引頻次學(xué)科排名




書目名稱Mathematics of Program Construction年度引用




書目名稱Mathematics of Program Construction年度引用學(xué)科排名




書目名稱Mathematics of Program Construction讀者反饋




書目名稱Mathematics of Program Construction讀者反饋學(xué)科排名

Interregnum

The Geometry of Synthesisges. Such languages are generally recognised as more accessible than hardware description languages, and it is expected that their use would significantly increase design productivity. The Geometry of Synthesis is a new hardware compilation technique which achieves this goal in a semantic-directed f

IDEAS

Scheduler-Independent Declassificationing languages. In this article, we aim at guaranteeing the security of concurrent programs. We propose the novel security property WHAT&WHERE that allows one to limit what information may be declassified where in a program. We show that our property provides adequate security guarantees independent

Debrief

送秋波

Scheduling and Buffer Sizing of n-Synchronous Systemsmputes static schedules of the processes and the sizes of the buffers between them..In this article, we present a new algorithm which solves the subtyping constraints generated by the clock calculus. The advantage of this algorithm is that it finds schedules for tightly coupled systems. Moreover, it

keloid

Deriving Real-Time Action Systems Controllers from Multiscale System Specificationsies. To this end, we incorporate the theory of time bands into action systems, which allows one to structure a system into multiple abstractions of time. The framework includes a logic that facilitates reasoning about different types of sampling errors and transient properties (i.e., properties that

卜聞

Calculating Graph Algorithms for Dominance and Shortest Patht path problem. Both algorithms are calculated directly from the definition of the properties by . of (1) a least fixed point expressing all finite paths through a directed graph and (2) Galois connections that capture dominance and path length..The approach illustrates that reasoning in the style o

冷峻

作嘔

filial

Unifying Correctness Statementsions. Algebras structure this diversity of models to avoid the repeated development of similar theories and to clarify their range of application. We introduce algebras that uniformly describe correctness statements, correctness calculi, pre-post specifications and loop refinement rules in five kind